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 language | English |
|---|---|
| Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems, ISCAS 1996 |
| Publisher | IEEE |
| Pages | 412-415 |
| Number of pages | 4 |
| ISBN (Print) | 0780330730 |
| DOIs | |
| Publication status | Published - May 1996 |
| Event | 1996 IEEE International Symposium on Circuits and Systems, ISCAS 1996 - Atlanta, United States Duration: 12 May 1996 → 15 May 1996 https://ieeexplore.ieee.org/xpl/conhome/3834/proceeding |
Publication series
| Name | Proceedings - IEEE International Symposium on Circuits and Systems |
|---|---|
| Publisher | IEEE |
| ISSN (Print) | 0271-4310 |
Conference
| Conference | 1996 IEEE International Symposium on Circuits and Systems, ISCAS 1996 |
|---|---|
| Country/Territory | United States |
| City | Atlanta |
| Period | 12/05/96 → 15/05/96 |
| Internet address |