Abstract
In this paper, we consider non-uniform wire-sizing. Given a wire segment of length ℓ, let f(x) be the width of the wire at position x, 0≤x≤ℓ. We show that the optimal wire-sizing function that minimizes the Elmore delay through the wire is f(x) = ae-bx, where a>0 and b>0 are constants that can be computed in O(1) time. In the case where lower bound (L>0) and upper bound (U>0) on the wire widths are given, we show that the optimal wire-sizing function f(x) is a truncated version of ae-bx that can also be determined in O(1) time. Our wire-sizing formula can be iteratively applied to optimally size the wire segments in a routing tree.
| Original language | English |
|---|---|
| Title of host publication | 33rd ACM/IEEE Design Automation Conference - Proceedings 1996 |
| Publisher | Association for Computing Machinery (ACM) |
| Pages | 487-490 |
| Number of pages | 4 |
| ISBN (Print) | 9780897917797, 0780332946 |
| DOIs | |
| Publication status | Published - Jun 1996 |
| Event | 33rd ACM/IEEE Design Automation Conference, DAC 1996 - Las Vegas, United States Duration: 3 Jun 1996 → 7 Jun 1996 https://dl.acm.org/doi/proceedings/10.1145/240518 (Link to conference proceedings) https://ieeexplore.ieee.org/xpl/conhome/3826/proceeding |
Publication series
| Name | ACM/IEEE Design Automation Conference - Proceedings |
|---|
Conference
| Conference | 33rd ACM/IEEE Design Automation Conference, DAC 1996 |
|---|---|
| Country/Territory | United States |
| City | Las Vegas |
| Period | 3/06/96 → 7/06/96 |
| Internet address |
|
Fingerprint
Dive into the research topics of 'Optimal wire-sizing formula under the Elmore delay model'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver