Abstract
This work presents a Steiner tree construction procedure, MVERT, to meet specified sink arrival time constraints. It is shown that the optimal tree requires the use of non-Hanan points. The procedure works in two phases: a minimum-delay Steiner tree is first constructed, after which the tree is iteratively modified, using an efficient binary search method, to reduce its length. Experimental results show that this procedure works particularly well for technologies where the interconnect resistance dominates, and significant cost savings are generated.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the International Symposium on Physical Design |
| Editors | Anon |
| Publisher | ACM |
| Pages | 205-210 |
| Number of pages | 6 |
| State | Published - Jan 1 1998 |
| Event | Proceedings of the 1998 International Symposium on Physical Design, ISPD-98 - Monterey, CA, USA Duration: Apr 6 1998 → Apr 8 1998 |
Other
| Other | Proceedings of the 1998 International Symposium on Physical Design, ISPD-98 |
|---|---|
| City | Monterey, CA, USA |
| Period | 4/6/98 → 4/8/98 |
Fingerprint
Dive into the research topics of 'Routing tree topology construction to meet interconnect timing constraints'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS