Fast algorithm for performance-oriented Steiner routing

Manjit Borah, Robert Michael Owens, Mary Jane Irwin

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

We present a routing algorithm which minimizes the Elmore delay to the identified critical sinks while producing 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. Our algorithm has a fast (O(n2), where n is the number of points) and practical implementation using simple data structures and techniques. Comparisons with other existing algorithms are presented along with results from a performance driven layout generator using our routing algorithm.

Original languageEnglish (US)
Pages (from-to)198-203
Number of pages6
JournalProceedings of the IEEE Great Lakes Symposium on VLSI
StatePublished - Jan 1 1995
EventProceedings of the 5th Great Lakes Symposium on VLSI - Buffalo, NY, USA
Duration: Mar 16 1995Mar 18 1995

Fingerprint

Routing algorithms
Routers
Data structures

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Borah, Manjit ; Owens, Robert Michael ; Irwin, Mary Jane. / Fast algorithm for performance-oriented Steiner routing. In: Proceedings of the IEEE Great Lakes Symposium on VLSI. 1995 ; pp. 198-203.
@article{bea6d9ccf7174dbe9cae686c056d725e,
title = "Fast algorithm for performance-oriented Steiner routing",
abstract = "We present a routing algorithm which minimizes the Elmore delay to the identified critical sinks while producing 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. Our algorithm has a fast (O(n2), where n is the number of points) and practical implementation using simple data structures and techniques. Comparisons with other existing algorithms are presented along with results from a performance driven layout generator using our routing algorithm.",
author = "Manjit Borah and Owens, {Robert Michael} and Irwin, {Mary Jane}",
year = "1995",
month = "1",
day = "1",
language = "English (US)",
pages = "198--203",
journal = "Proceedings of the IEEE Great Lakes Symposium on VLSI",
issn = "1066-1395",
publisher = "IEEE Computer Society",

}

Fast algorithm for performance-oriented Steiner routing. / Borah, Manjit; Owens, Robert Michael; Irwin, Mary Jane.

In: Proceedings of the IEEE Great Lakes Symposium on VLSI, 01.01.1995, p. 198-203.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Fast algorithm for performance-oriented Steiner routing

AU - Borah, Manjit

AU - Owens, Robert Michael

AU - Irwin, Mary Jane

PY - 1995/1/1

Y1 - 1995/1/1

N2 - We present a routing algorithm which minimizes the Elmore delay to the identified critical sinks while producing 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. Our algorithm has a fast (O(n2), where n is the number of points) and practical implementation using simple data structures and techniques. Comparisons with other existing algorithms are presented along with results from a performance driven layout generator using our routing algorithm.

AB - We present a routing algorithm which minimizes the Elmore delay to the identified critical sinks while producing 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. Our algorithm has a fast (O(n2), where n is the number of points) and practical implementation using simple data structures and techniques. Comparisons with other existing algorithms are presented along with results from a performance driven layout generator using our routing algorithm.

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

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

M3 - Conference article

AN - SCOPUS:0029238204

SP - 198

EP - 203

JO - Proceedings of the IEEE Great Lakes Symposium on VLSI

JF - Proceedings of the IEEE Great Lakes Symposium on VLSI

SN - 1066-1395

ER -