|
ABSTRACT
At the 250nm technology node, interconnect delays account for over 40% of worst delays [12]. Transition to 130nm and below increases this figure, and hence the relative importance of timing-driven placement for VLSI. Our work introduces a novel minimization of maximal path delay that improves upon previously known algorithms for timing-driven placement. Our placement algorithms have provable properties and are fast in practice. Empirical validation is based on extending a scalable min-cut placer with proven quality in wirelength- and congestion-driven placement [4]. The CPU overhead of the timing-driven capability is within 50%. We placed industrial circuits and evaluated the resulting layouts with a commercial static timing analyzer.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
A. E. Caldwell, A. B. Kahng, S. Mantik, I. L. Markov and A. Zelikovsky, "On Wirelength Estimations for Row-Based Placement", IEEE Trans. on CAD, 18(9), Sept. 1999, pp. 1265--1278.
|
| |
3
|
A. E. Caldwell, A. B. Kahng and I. L. Markov, "Optimal Partitioning and End-Case Placement for Standard-Cell Layout", IEEE Trans. on CAD, 19(11), Nov. 2000, pp. 1304--1313.
|
 |
4
|
Andrew E. Caldwell , Andrew B. Kahng , Igor L. Markov, Can recursive bisection alone produce routable placements?, Proceedings of the 37th conference on Design automation, p.477-482, June 05-09, 2000, Los Angeles, California, United States
[doi> 10.1145/337292.337549]
|
| |
5
|
C.-C. Chang, J. Lee, M. Stabenfeldt and R.-S. Tsay, "A Practical All-Path Timing-Driven Place and Route Design System", Proc. Asia-Pacific Conf. on Circuits and Systems, 1994, pp. 560--563.
|
| |
6
|
A. H. Chao, E. M. Nequist and T. D. Vuong, "Direct Solutions of Performance Constraints During Placement", Proc. Custom Integrated Circuits Conf., 1990, pp. 27.2.1--27.2.4.
|
 |
7
|
|
| |
8
|
|
| |
9
|
A. E. Dunlop and B. W. Kernighan, "A Procedure for Placement of Standard Cell VLSI Circuits", IEEE Trans. on CAD 4(1), 1985, pp. 92--98.
|
 |
10
|
|
| |
11
|
|
 |
12
|
Padmini Gopalakrishnan , Altan Odabasioglu , Lawrence Pileggi , Salil Raje, Overcoming wireload model uncertainty during physical design, Proceedings of the 2001 international symposium on Physical design, p.182-189, April 01-04, 2001, Sonoma, California, United States
[doi> 10.1145/369691.369769]
|
 |
13
|
|
 |
14
|
Takeo Hamada , Chung-Kuan Cheng , Paul M. Chau, Prime: a timing-driven placement tool using a piecewise linear resistive network approach, Proceedings of the 30th international conference on Design automation, p.531-536, June 14-18, 1993, Dallas, Texas, United States
[doi> 10.1145/157485.165015]
|
| |
15
|
P. S. Hauge, R. Nair and E. J. Yoffa, "Circuit Placement for Predictable Performance", Proc. Intl. Conf. on Computer-Aided Design, 1987, pp. 88--91.
|
| |
16
|
R. B. Hitchcock, Sr., G. L. Smith and D. D. Cheng, "Timing Analysis of Computer Hardware", IBM J. Res. Develop. 26(1), 1982, pp. 100--108.
|
| |
17
|
M. A. B. Jackson, A. Srinivasan and E. S. Kuh, "A Fast Algorithm for Performance-Driven Placement", Proc. Intl. Conf. on Computer-Aided Design, pp. 328--331.
|
| |
18
|
T. Koide, M. Ono, S. Wakabayashi and Y. Nishimaru, "Par-POPINS: A Timing-Driven Parallel Placement Method with the Elmore Delay Model for Row Based VLSIs". Proc. Asia and South Pacific Design Automation Conf., 1997, pp. 133--140.
|
| |
19
|
D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed., Addison Wesley, 1984.
|
 |
20
|
|
| |
21
|
M. Marek-Sadowska and S. P. Lin, "Timing-Driven Layout of Cell-Based ICs", VLSI Systems Design, May 1986, pp.63--73.
|
| |
22
|
M. Marek-Sadowska and S. P. Lin, "Timing Driven Placement", Proc. Intl. Conf. on Computer-Aided Design, 1989, pp. 94--97.
|
| |
23
|
R. Nair, C. L. Berman, P. S. Hauge and E. J. Yoffa, "Generation of Performance Constraints for Layout", IEEE Trans. on CAD 8(8), Aug. 1989, pp. 860--874.
|
 |
24
|
|
| |
25
|
B. M. Riess and G. G. Ettelt, "Speed: Fast and Efficient Timing Driven Placement", Proc. Intl. Symp. on Circuits And Systems, 1995, pp. 377--380.
|
 |
26
|
Majid Sarrafzadeh , David Knol , Gustavo Tellez, Unification of budgeting and placement, Proceedings of the 34th annual conference on Design automation, p.758-761, June 09-13, 1997, Anaheim, California, United States
[doi> 10.1145/266021.266364]
|
 |
27
|
|
| |
28
|
H. Youssef, R.-B. Lin and E. Shragowitz, "Bounds on Net Delays for VLSI Circuits", IEEE Trans. on Circuits and Systems, 39(11), Nov. 1992, pp. 815--824.
|
CITED BY 16
|
|
Saurabh N. Adya , Mehmet C. Yildiz , Igor L. Markov , Paul G. Villarrubia , Phiroze N. Parakh , Patrick H. Madden, Benchmarking for large-scale placement and beyond, Proceedings of the 2003 international symposium on Physical design, April 06-09, 2003, Monterey, CA, USA
|
|
|
Sung-Woo Hur , Tung Cao , Karthik Rajagopal , Yegna Parasuram , Amit Chowdhary , Vladimir Tiourin , Bill Halpin, Force directed mongrel with physical net constraints, Proceedings of the 40th conference on Design automation, June 02-06, 2003, Anaheim, CA, USA
|
|
|
Karthik Rajagopal , Tal Shaked , Yegna Parasuram , Tung Cao , Amit Chowdhary , Bill Halpin, Timing driven force directed placement with physical net constraints, Proceedings of the 2003 international symposium on Physical design, April 06-09, 2003, Monterey, CA, USA
|
|
|
|
|
|
Zhong Xiu , David A. Papa , Philip Chong , Christoph Albrecht , Andreas Kuehlmann , Rob A. Rutenbar , Igor L. Markov, Early research experience with OpenAccess gear: an open source development environment for physical design, Proceedings of the 2005 international symposium on Physical design, April 03-06, 2005, San Francisco, California, USA
|
|
|
|
|
|
|
|
|
Amit Chowdhary , Karthik Rajagopal , Satish Venkatesan , Tung Cao , Vladimir Tiourin , Yegna Parasuram , Bill Halpin, How accurately can we model timing in a placement engine?, Proceedings of the 42nd annual conference on Design automation, June 13-17, 2005, San Diego, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|