Fast algorithm for optimal wire-sizing under Elmore delay model

Chung Ping Chen*, D. F. Wong

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

21 Citations (Scopus)

Abstract

In this paper, we present a fast algorithm for continuous wire-sizing under the distributed Elmore delay model. Our algorithm GWSA-C is an extension of the GWSA algorithm (for discrete wire-sizing) in [CL93a]. GWSA-C is an iterative algorithm with guaranteed convergence to optimal wire-sizing solutions. When specialized to discrete wire-sizing problems, GWSA-C is an improved implementation of GWSA, both in terms of runtime and memory usage. GWSA-C is extremely fast even on very large problems. For example, we can solve a 1,000,000 wire-segment problem in less than 3 minutes runtime on an IBM RS/6000 workstation. This kind of efficiency in wire-sizing has never been reported in the literature.

Original languageEnglish
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems, ISCAS 1996
PublisherIEEE
Pages412-415
Number of pages4
ISBN (Print)0780330730
DOIs
Publication statusPublished - May 1996
Event1996 IEEE International Symposium on Circuits and Systems, ISCAS 1996 - Atlanta, United States
Duration: 12 May 199615 May 1996
https://ieeexplore.ieee.org/xpl/conhome/3834/proceeding

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
PublisherIEEE
ISSN (Print)0271-4310

Conference

Conference1996 IEEE International Symposium on Circuits and Systems, ISCAS 1996
Country/TerritoryUnited States
CityAtlanta
Period12/05/9615/05/96
Internet address

Scopus Subject Areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Fast algorithm for optimal wire-sizing under Elmore delay model'. Together they form a unique fingerprint.

Cite this