A fast algorithm for minimizing the elmore delay to identified critical sinks

Manjit Borah, Robert M. Owens, Mary Jane Irwin

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


A routing algorithm that generates a Steiner route for a set of sinks with near optimal Elmore delay to the critical sink is presented. The algorithm outperforms the best existing alternative for Elmore-delay-based critical sink routing. With no critical sinks present, the algorithm produces routes comparable to the best previously existing Steiner router. Since performance-oriented layout generators employ iterative techniques that require a large number of calls to the routing algorithm for layout evaluation, a fast algorithm for routing is desirable. The algorithm presented here has a fast (O(n2), where n is the number of points) and practical implementation using simple data structures and techniques.

Original languageEnglish (US)
Pages (from-to)753-759
Number of pages7
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Issue number7
StatePublished - 1997

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering


Dive into the research topics of 'A fast algorithm for minimizing the elmore delay to identified critical sinks'. Together they form a unique fingerprint.

Cite this