Large-scale circuit placement

ACM Transactions on Design Automation of Electronic Systems

Volumn 10, Issue 2, 2005, Pages 389-430

  Cong, Jason ^a,d   Shinnerl, Joseph R ^a,d   Xie, Min ^a,d   Kong, Tim ^b   Yuan, Xin ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MAGMA DESIGN AUTOMATION   (United States)

^c IBM   (United States)

^d University of California   (United States)

Author keywords

Large scale optimization; Optimality; Placement; Scalability

Indexed keywords

EID: 30544433363     PISSN: 10844309     EISSN: 10844309     Source Type: Journal    
DOI: 10.1145/1059876.1059886     Document Type: Review

References (105)

1. ADYA, S., CHATURVEDI, S., ROY, J., PAPA, D. A., AND MARKOV, I. 2004. Unification of partitioning, placement, and floorplanning. In Proceedings of the International Conference on Computer-Aided Design (Nov.). 550-557.
2. ADYA, S., YILDIZ, M., MARKOV, I., VILLARRUBIA, P., PARAKH, P., AND MADDEN, P. 2003. Benchmarking for large-scale placement and beyond. In Proceedings of the International Symposium on Physical Design. 95-103.
3. ADYA, S. N. AND MARKOV, I. L. 2002. Consistent placement of macro-blocks using floorplanning and standard-cell placement. In Proceedings of the International Symposium on Physical Design (Apr.). 12-17.
4. AGNIHOTRI, A. R., YILDIZ, M. C., KHATKHATE, A., MATHUR, A., ONO, S., AND MADDEN, P. H. 2003. Fractional cut: Improved recursive bisection placement. In Proceedings of the International Conference on Computer-Aided Design. 307-310.
5. ALPERT, C. J. 1998. The ISPD98 circuit benchmark suite. In Proceeding of the International Symposium on Physical Design. 85-90.
6. ARROW, K., HURIWICZ, L., AND UZAWA, H. 1958. Studies in Nonlinear Programming. Stanford University Press, Stanford, Calif.
7. BETZ, V. AND ROSE, J. 1997. VPR: A new packing, placement, and routing tool for FPGA research. In Proceedings of the International Workshop on FPL. pp. 213-222.
8. BRANDT, A. 1986. Algebraic multigrid theory: The symmetric case. Appl. Math. Comp. 19, 23-56.
9. BRANDT, A. AND RON, D. 2002. Multigrid solvers and multilevel optimization strategies. Multilevel Optimization and VLSICAD. Kluwer Academic Publishers, Boston, Mass., Chap. 1.
10. BRENNER, U., PAULI, A., AND VYGEN, J. 2004. Almost optimum placement legalization by minimum cost flow and dynamic programming. In Proceedings of the International Symposium on Physical Design. 2-8.
11. BRENNER, U. AND ROHE, A. 2003. An effective congestion-driven placement framework. IEEE Trans. CAD 22, 4 (Apr.), 387-394.
12. BRENNER, U. AND ROHE, A. Apr 2002. An effective congestion-driven placement framework. In Proceedings of the International Symposium on Physical Design.
13. BREUER, M. 1977. Min-Cut Placement. J. Design Automat. Fault Tolerant Comput. 1, 4 (Oct.), 343-362.
14. BRIGGS, W., HENSON, V., AND MCUORMICK, S. 2000. A Multigrid Tutorial, 2nd ed. SIAM, Philadelphia, Pa.
15. BURSTEIN, M. AND YOUSSEF, M. N. 1985. Timing influenced layout design. In Proceedings of the ACM / IEEE Design Automation Conference. ACM, New York, 124-130.
16. CADENCE DESIGN SYSTEMS, INC. 1999. QPlace version 5.1.55, compiled on 10/25/1999. Envisia ultra placer reference.
17. CALDWELL, A., KAHNG, A. B., AND MARKOV, I. 2000a. Improved algorithms for hypergraph partitioning. In Proceedings of the Asia South Pacific Design Automation Conference.
18. CALDWELL, A., KAHNG, A., AND MARKOV, I. 2000b. Can recursive bisection produce routable placements? In Proceedings of the 37th IEEE/ACM Design Automation Conference. ACM, New York, 477-482.
19. CALDWELL, A., KAHNG, A., AND MARKOV, I. 2000c. Iterative partitioning with varying node weights. VLSI Design II, 3, 249-258.
20. CALDWELL, A., KAHNG, A., AND MARKOV, I. 2000d. Optimal partitioners and end-case placers for standard-cell layout. IEEE Trans. on CAD 19, 11, 1304-1314.
21. CHAN, T., CONG, J., KONG, T., AND SHINNERL, J. 2003a. Multilevel circuit placement. Multilevel Optimization in VLSICAD. Kluwer, Boston, Mass., Chap. 4.
22. CHAN, T., CONG, J., KONG, T., AND SHINNERL, J. 2000. Multilevel optimization for large-scale circuit placement. In Proceedings of the IEEE International Conference on Computer-Aided Design (San Jose, Calif.). IEEE Computer Society Press, Los Alamitos, Calif. 171-176.
23. CHAN, T., CONG, J., KONG, T., SHINNERL, J., AND SZE, K. 2003b. An enhanced multilevel algorithm for circuit placement. In Proceedings of the IEEE International Conference on Computer Aided Design (San Jose, Calif.). IEEE Computer Society Press, Los Alamitos, Calif.
24. CHAN, T., CONG, J., AND SZE, K. 2005. Multilevel generalized force-directed method for circuit placement. In Proceedings of the International Symposium on Physical Design.
25. CHANG, C.-C., CONG, J., PAN, D., AND YUAN, X. 2003a. Multilevel global placement with congestion control. IEEE Trans. CAD 22, 4 (Apr.), 395-409.
26. CHANG, C. C., CONG, J., AND XIE, M. 2003b. Optimality and scalability study of existing placement algorithms. In Proceedings of the Asia South Pacific Design Automation Conference. 621-627.
27. CHANG, C.-C., LEE, J., STABENFELDT, M., AND TSAY, R. S. 1994. A practical all-path timing-driven place and route design system. In Proceedings of the Asia-Pacific Conference on Circuits and Systems. 560-563.
28. CHEN, C., YANG, X., AND SARRAFZADEH, M. 2000. Potential slack: An effective metric of combinational circuit performance. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. ACM, New York, 198-201.
29. CHEN, H., CHENG, C.-K., CHOU, N.-C., KAHNG, A., MACDONALD, J., SUARIS, P., YAO, B., AND ZHU, Z. 2003. An algebraic multigrid solver for analytical placement with layout-based clustering. In Proceedings of the IEEE/ACM Design Automation Conference, ACM, New York, 794-799.
30. CHENG, C. AND KUH, E. 1984. Module placement based on resistive network optimization. IEEE Trans. CAD. CAD-3, 3.
31. CHENG, C.-L. E. 1994. RISA: Accurate and efficient placement routability modeling. In Proceedings of the International Conference on Computer-Aided Design, 690-695.
32. CHU, C. AND VISWANATHAN, N. 2004. FastPlace: Efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model. In Proceedings of the International Symposium on Physical Design (Apr.). 26-33.
33. CONG, J. 2001. An interconnect-centric design flow for nanometer technologies. Proc. IEEE 89, 4 (Apr.), 505-527.
34. CONG, J. AND LIM, S. 2000. Edge separability based circuit clustering with application to circuit partitioning. In Proceedings of the Asia South Pacific Design Automation Conference (Yokohama Japan). 429-434.
35. CONG, J., ROMESIS, M., AND SHINNERL, J. 2005a. Fast floorplanning by look-ahead enabled recursive bipartitioning. In Proceedings of the Asia Asia South Pacific Design Automation Conference.
36. CONG, J., ROMESIS, M., AND SHINNERL, J. 2005b. Robust mixed-size placement by recursive legalized bipartitioning. Report 040057, Computer Science Dept., University of California, Los Angeles, Calif., ftp://ftp.cs.ucla.edu/tech-report/2005-reports/040057.pdf.
37. CONG, J., ROMESIS, M., AND XIE, M. Nov 2003a. Optimality and stability of timing-driven placement algorithms. In Proceedings of the IEEE International Conference on Computer Aided Design. (San Jose, Calif.). IEEE Computer Society Press, Los Alamitos, Calif.
38. CONG, J., ROMESIS, M., AND XIE, M. 2003b. Optimality, scalability and stability study of partitioning and placement algorithms. In Proceedings of the International Symposium on Physical Design. 88-94.
39. CONG, J., ROMESIS, M., AND XIE, M. 2004. UCLA Optimality Study Project, http://cadlab.cs. ucla.edu/~pubbench.
40. DUNLOP, A. AND KERNIGHAN, B. 1985. A procedure for placement of standard-cell VLSI circuits. IEEE Trans. CAD. CAD-4, 1 (Jan.).
41. DUNLOP, A. E., AGRAWAL, V. D., DEUTSCH, D. N., JUKL, M. F., KOZAK, P., AND WIESEL, M. 1984. Chip layout optimization using critical path weighting. In Proceedings of the ACM/IEEE Design Automation Conference. ACM, New York, 133-136.
42. EISENMANN, H. AND JOHANNES, F. 1998. Generic global placement and floorplanning. In Proceedings of the 35th ACM / IEEE Design Automation Conference. ACM, New York, 269-274.
43. EVANS, L. C. 2002. Partial Diferential Equations. American Mathematical Society, Providence, R. I.
44. FIDUCCIA, C. M. AND MATTHEYSES, R. M. 1982. A linear-time heuristic for improving network partitions. In Proceedings of the Design Automation Conference, ACM, New York, 175-181.
45. GAO, T., VAIDYA, P. M., AND LIU, C. L. 1991. A new performance driven placement algorithm. In IEEE/ACM International Conference on Computer-Aided Design. ACM, New York, 44-47.
46. GOLUB, G. AND VAN LOAN, C. 1989. Matrix Computations, 2nd ed. The Johns Hopkins University Press, Baltimore, Md.
47. GOTO, S. 1981. An efficient algorithm for the two-dimensional placement problem in electrical circuit layout. IEEE Trans. Circuits and Systems 28, 1 (Jan.), 12-18.
48. HAGEN, L., HUANG, J. H., AND KAHNG, A. B. 1997. On implementation choices for iterative improvement partitioning algorithms. IEEE Trans. CAD 16, 10, 1199-1205.
49. HAGEN, L. W., HUANG, D. J.-H., AND KAHNG, A. B. 1995. Quantified suboptimality of VLSI layout heuristics. In Proceedings of the Design Automation Conference. ACM, New York, 216-221.
50. HALPIN, B., CHEN, C., AND SEHGAL, N. 2001. Timing driven placement using physical net constraints. In Proceedings of the ACM / IEEE Design Automation Conference. ACM, New York, 780-783.
51. HAMADA, T., CHENG, C. K., AND CHAU, P. M. 1993. Prime: A timing-driven placement tool using a piecewise linear resistive network approach. In Proceedings of the ACM/IEEE Design Automation Conference. ACM, New York, 531-536.
52. HAUGE, P. S., NAIR, R., AND YOFFA, E. J. 1987. Circuit placement for predictable performance. In Proceedings of the IEEE / ACM International Conference on Computer-Aided Design, ACM, New York, 88-91.
53. HU, B. AND MAREK-SADOWSKA, M. 2002. Congestion minimization during placement without estimation. In Proceedings of the International Conference on Computer-Aided Design. 739-745.
54. HU, B. AND MAREK-SADOWSKA, M. 2003. Wire length prediction based clustering and its application in placement. In Proceedings of the Design Automation Conference.
55. HU, B. AND MAREK-SADOWSKA, M. 2004. Fine granularity clustering based placement. IEEE Trans. CAD 23, 1264-1276.
56. HUR, S.-W. AND LILLIS, J. 2000. Mongrel: Hybrid techniques for standard-cell placement. In Proceedings of the IEEE International Conference on Computer-Aided Design (San Jose, Calif., Nov.). IEEE Computer Society Press, Los Alamitos, Calif., 165-170.
57. JACKSON, M. AND KUH, E. S. 1989. Performance-driven placement of cell based ICs. In Proceedings of ACM / IEEE Design Automation Conference. ACM, New York, 370-375.
58. KAHNG, A. AND REDA, S. 2004. Placement feedback: A concept and method for better min-cut placements. In Proceedings of ACM/IEEE Design Automation Conference. ACM, New York, 357-362.
59. KAHNG, A. AND WANG, Q. 2004. Implementation and extensibility of an analytic placer. In Proceedings of the International Symposium on Physical Design. 18-25.
60. KARYPIS, G. 1999. Multilevel algorithms for multi-constraint hypergraph partitioning. Tech. Rep. 99-034, Department of Computer Science, University of Minnesota, Minneapolis, Minn.
61. KARYPIS, G. 2003. Multilevel hypergraph partitioning. Multilevel Optimization and VLSICAD. Kluwer Academic Publishers, Boston, Mass., Chap. 3.
62. KHATKHATE, A., LI, C., AGNIHOTRI, A. R., ONO, S., YILDIZ, M. C., KOH, C.-K, AND MADDEN, P. H. 2004. Recursive bisection based mixed block placement. In Proceedings of the International Symposium on Physical Design.
63. KLEINHANS, J., SIGL, G., JOHANNES, F., AND ANTREICH, K. 1991. Gordian: VLSI placement by quadratic programming and slicing optimization. IEEE Trans. CAD CAD-10, 356-365.
64. KONG, T. 2002. A novel net weighting algorithm for timing-driven placement. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. ACM, New York, 172-176.
65. LI, C. AND KOH, C.-K. 2003. On improving recursive bipartitioning-based placement. Tech. Rep. TR-ECE 03-14, Purdue University.
66. LI, C., XIE, M., KOH, C., CONG, J., AND MADDEN, P. 2004. Routability-driven placement and white space allocation. In Proceedings of the International Conference on Computer-Aided Design. 394-401.
67. LOU, J., THAKUB, S., KRISHNAMOORTHY, S., AND SHENG, H. 2002. Estimating routing congestion using probabilistic analysis. IEEE Trans. CAD 21, 1 (Jan.), 32-41.
68. LUK, W. K. 1991. A fast physical constraint generator for timing driven layout. In Proceedings of the ACM/IEEE Design Automation Conference. ACM, New York, 626-631.
69. MAREK-SADOWSKA, M. AND LIN, S. P. 1989. Timing driven placement. In Proceedings of the IEEE / ACM International Conference on Computer-Aided Design. ACM, New York 94-97.
70. MARQUARDT, A., BETZ, V., AND ROSE, J. 2000. Timing-driven placement for FPGAs. In Proceedings of the ACM Symposium on FPGAs. ACM, New York, 203-213.
71. MAYRHOFER, S. AND LAUTHER, U. 1990. Congestion-driven placement using a new multi-partitioning heuristic. In Proceedings of the International Conference on Computer-Aided Design. 332-335.
72. MORTON, K. W. AND MAYERS, D. F. 1994. Numerical Solution of Partial Differential Equations. Cambridge University Press.
73. NAIR, R., HERMAN, C. L., HAUGE, P., AND YOFFA, E. J. 1989. Generation of performance constraints for layout. IEEE Trans. CAD Integ. Circ. Syst. 8, 8, 860-874.
74. NAYLOR, W. C., DONELLY, R., AND SHA, L. 2001. Nonlinear optimization system and method for wire length and delay optimization for an automatic electric circuit placer.
75. ONO, S. AND MADDEN, P. 2005. On structure and suboptimality in placement. In Proceedings of the Asia South Pacific Design Automation Conference.
76. PARAKH, P. N., BROWN, R. B., AND SAKALLAH, K. A. 1998. Congestion driven quadratic placement. In Proceedings of the Design Automation Conference. 275-278.
77. QUINN, N. AND BREUER, M. 1979. A force-directed component placement procedure for printed circuit boards. IEEE Trans. Circ Syst CAS CAS-26, 377-388.
78. RAMACHANDARAN, P., ONO, S., AGNIHOTRI, A., DAMODARA, P., SRIHARI, H., AND MADDEN, P. 2005. Optimal placement by branch-and-price. In Proceedings of the Asia South Pacific Design Automation Conference. (Jan.).
79. REN, H., PAN, D., AND KUNG, D. 2004. Sensitivity guided net weighting for placement driven synthesis. In Proceedings of the International Symposium on Physical Design. 10-17.
80. SAAD, Y. 1996. Iterative Methods for Sparse Linear Systems. PWS publishing, Pacific Grove, Calif.
81. SANKAR, Y. AND ROSE, J. 1999. Trading quality for compile time: Ultra-fast placement for FPGAs. In FPGA99, ACM Symposium on FPGAs. ACM, New York, 157-166.
82. SARRAFZADEH, M., KNOL, D. A., AND TELLEZ, G. E. 1997a. A delay budgeting algorithm ensuring maximum flexibility in placement. IEEE Trans. CAD of Integ. Circ. Syst. 16, 11, 1332-1341.
83. SARRAFZADEH, M., KNOL, D. A., AND TELLEZ, G. E. 1997b. Unification of budgeting and placement. In Proceedings of the ACM/IEEE Design Automation Conference. ACM, New York, 758-761.
84. SARRAFZADEH, M., WANG, M., AND YANG, X. 2002. Modern Placement Techniques. Kluwer, Boston, Mass.
85. SENN, M., SEIDL, U., AND JOHANNES, F. 2002. High quality deterministic timing driven FPGA placement. In Proceedings of the ACM Symposium on FPGAs. ACM, New York.
86. SIGL, G., DOLL, K., AND JOHANNES, F. 1991. Analytical placement: A linear or a quadratic objective function? In Proceedings of the 28th ACM/IEEE Design Automation Conference. ACM, New York, 427-432.
87. SRINIVASAN, A., CHAUDHARY, K., AND KUH, E. S. 1991. RITUAL: A performance driven placement for small-cell ICs. In Proceedings of the IEEE / ACM International Conference on Computer-Aided Design. ACM, New York, 48-51.
88. SWARTZ, W. AND SECHEN, C. 1995. Timing-driven placement for large standard cell circuits. In Proceedings of the ACM / IEEE Design Automation Conference. ACM, New York, 211-215.
89. TELLEZ, G. E., KNOL, D. A., AND SARRAFZADEH, M. 1996. A performance-driven placement technique based on a new net budgeting criterion. In Proceedings of the International Symposium on Circuits and Systems. 504-507.
90. TSAY, R., KUH, E., AND HSU, C. 1988. Proud: A fast sea-of-gates placement algorithm. IEEE Desi. Test Comput. 44-56.
91. TSAY, R. S. AND KOEHL, J. 1991. An analytic net weighting approach for performance optimization in circuit placement. In Proceedings of the ACMI IEEE Design Automation Conference. ACM, New York, 620-625.
92. VORWERK, K., HENNINGS, A., AND VANNELLI, A. 2004. Engineering details of a stable force-directed placer. In Proceedings of the International Conference on Computer-Aided Design. 573-580.
93. VYGEN, J. 1997. Algorithms for large-scale flat placement. In Proceedings of the 34th ACM / IEEE Design Automation Conference. ACM, New York, 746-751.
94. VYGEN, J. 2000. Four-way partitioning of two-dimensional sets. Report 00900-OR, Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany.
95. WANG, Q., JARIWALA, D., AND LILLIS, J. 2005. A study of tighter lower bounds in LP relaxation-based placement. In Proceedings of the Great Lakes Symposium on VLSI. To appear.
96. WANG, M., YANG, X., AND SARRAFZADEH, M. 2000. Dragon2000: Standard-cell placement tool for large circuits. In Proceedings of the IEEE / ACM International Conference on Computer-Aided Design, ACM, New York, 260-263.
97. WESTRA, J., BARTELS, C., AND GROENEVELD, P. 2004. Probabilistic congestion prediction. In Proceedings of the International Symposium on Physical Design. 204-209.
98. XIU, Z., MA, J., FOWLER, S., AND RUTENBAR, R. 2004. Large-scale placement by grid warping. In Proceedings of the Design Automation Conference. 351-356.
99. YANG, X., CHOI, B., AND SARRAFZADEH, M. 2002a. Timing-driven placement using design hierarchy guided constraint generation. In Proceedings of the IEEE / ACM International Conference on Computer-Aided Design. ACM, New York, 177-180.
100. YANG, X., CHOI, B., AND SARRAFZADEH, M. 2003. Routability-driven white space allocation for fixed-die standard-cell placement. IEEE Trans, CAD 22, 4 (Apr.), 410-419.
101. YANG, X., KASTNER, R., AND SAKRAFZADEH, M. 2002b. Congestion estimation during top-down placement. IEEE Trans. CAD 21, 1 (Jan.), 72-80.
102. YILDIZ, M. AND MADDEN, P. 2001a. Global objectives for standard cell placement. In Proceedings of the 11th Great-Lakes Symposium on VLSI. 68-72.
103. YILDIZ, M. AND MADDEN, P. 2001b. Improved cut sequences for partitioning-based placement. In Proceedings of the Design Automation Conference. 776-779.
104. YOUSSEF, H., LIN, R. B., AND SHRAGOWITZ, S. 1992. Bounds on net delays. IEEE Trans. Circ. Syst. 39, 11, 815-824.
105. YOUSSEF, H. AND SHRAGOWITZ, E. 1990. Timing constraints for correct performance. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design. ACM, New York, 24-27.