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

Manjit Borah, Robert M. Owens, Mary Jane Irwin

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

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
Volume16
Issue number7
DOIs
StatePublished - Dec 1 1997

Fingerprint

Routing algorithms
Routers
Data structures

All Science Journal Classification (ASJC) codes

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

Cite this

@article{bf1d93315bef43789d23bffa3409462b,
title = "A fast algorithm for minimizing the elmore delay to identified critical sinks",
abstract = "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.",
author = "Manjit Borah and Owens, {Robert M.} and Irwin, {Mary Jane}",
year = "1997",
month = "12",
day = "1",
doi = "10.1109/43.644036",
language = "English (US)",
volume = "16",
pages = "753--759",
journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
issn = "0278-0070",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

A fast algorithm for minimizing the elmore delay to identified critical sinks. / Borah, Manjit; Owens, Robert M.; Irwin, Mary Jane.

In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 16, No. 7, 01.12.1997, p. 753-759.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Borah, Manjit

AU - Owens, Robert M.

AU - Irwin, Mary Jane

PY - 1997/12/1

Y1 - 1997/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031177080&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031177080&partnerID=8YFLogxK

U2 - 10.1109/43.644036

DO - 10.1109/43.644036

M3 - Article

AN - SCOPUS:0031177080

VL - 16

SP - 753

EP - 759

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

SN - 0278-0070

IS - 7

ER -