A fast hierarchical quadratic placement algorithm

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 25, Issue 4, 2006, Pages 678-691

  Nam, Gi Joon ^a,b,d   Reda, Sherief ^a,c   Alpert, Charles J ^a,b   Villarrubia, Paul G ^a,b   Kahng, Andrew B ^a,c,e  

^a IEEE   (United States)

^b IBM   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d ACM   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Clustering; Physical design; Placement; Very large scale integration (VLSI)

Indexed keywords

CLUSTERING; PHYSICAL DESIGN; PLACEMENTS; VERY LARGE SCALE INTEGRATION (VLSI);

BENCHMARKING; DATA STRUCTURES; HIERARCHICAL SYSTEMS; QUEUEING THEORY; VLSI CIRCUITS;

ALGORITHMS;

EID: 33645654995     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2006.870079     Document Type: Conference Paper

References (25)

1. C. J. Alpert, "The ISPD98 circuit benchmark suite," in Proc. Int. Symp. Physical Design, Monterey, CA, 1998, pp. 80-85.
2. C. J. Alpert, G.-J. Nam, and P. G. Villarrubia, "Effective free space management for cut-based placement," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 22, no. 10, pp. 1343-1353, Oct. 2003.
3. C. J. Alpert, J. H. Huang, and A. B. Kahng, "Multilevel circuit partitioning," in Proc. ACM/IEEE Design Automation Conf, Anaheim, CA, 1997, pp. 530-533.
4. C. J. Alpert and A. B. Kahng, "A general framework for vertex orderings, with application to netlist clustering," in Proc. ACM/IEEE Design Automation Conf., San Diego, CA, 1994, pp. 63-67.
5. T. N. Bui, "Improving the performance of Kernighan-Lin and simulated annealing graph bisection algorithms," in Proc. ACM/IEEE Design Automation Conf., Las Vegas, NV, 1989, pp. 775-778.
6. A. E. Caldwell, A. B. Kahng, and I. L. Markov, "Can recursive bisection alone produce routable placements?," in Proc. ACM/IEEE Design Automation Conf., Los Angeles, CA, 2000, pp. 477-482.
7. T. Chan, J. Cong, T. Kong, and J. Shinnerl, "Multilevel optimization for large-scale circuit placement," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, San Jose, CA, 2000, pp. 171-176.
8. T. Chan, J. Cong, T. Kong, J. Shinnerl, and K. Sze, "An enhanced multilevel algorithm for circuit placement," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, San Jose, CA, 2003, pp. 299-305.
9. C.-C. Chang, J. Cong, D. Pan, and X. Yuan, "Multilevel global placement with congestion control," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 22, no. 4, pp. 395-409, Apr. 2003.
10. C.-C. Chang, J. Cong, Z. Pan, and X. Yuan, "Physical hierarchy generation with routing congestion control," in Proc. ACM/IEEE Int. Symp. Physical Design, Del Mar, CA, 2002, pp. 36-41.
11. J. Cong, L. Hagen, and A. B. Kahng, "Random walks for circuit clustering," in Proc. IEEE Int. Conf. ASIC, Rochester, NY, 1991, pp. 14.2.1-14.2.4.
12. J. Cong and S. K. Lim, "Edge separability-based circuit clustering with application to multilevel circuit partitioning," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 23, no. 3, pp. 346-357, Mar. 2004.
13. H. Eisenmann and F. M. Johannes, "Generic global placement and floor-planning," in Proc. ACM/IEEE Design Automation Conf, San Francisco, CA, 1998, pp. 269-274.
14. B. Hu and M. M. Sadowska, "Fine granularity clustering-based placement," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 23, no. 4, pp. 527-536, Apr. 2004.
15. D. J.-H. Huang and A. B. Kahng, "Partitioning based standard cell global placement with an exact objective," in Proc. ACM/IEEE Int. Symp. Physical Design, Napa Valley, CA, 1997, pp. 18-25.
16. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, "Multilevel hypergraph partitioning: Application in VLSI domain," in Proc. ACM/IEEE Design Automation Conf., Anaheim, CA, 1997, pp. 526-529.
17. G. Karypis and V. Kumar, "Multilevel k-way hypergraph partitioning," in Proc. ACM/IEEE Design Automation Conf., New Orleans, LA, 1999, pp. 343-348.
18. J. M. Kleinhans, G. Sigl, F. M. Johannes, and K. J. Antreich, "GORDIAN: VLSI placement by quadratic programming and slicing optimization," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 10, no. 3, pp. 356-365, Mar. 1991.
19. G.-J. Nam, C. J. Alpert, P. G. Villarrubia, B. Winter, and M. Yildiz, "The ISPD2005 placement contest and benchmark suite," in Proc. ACM/IEEE Int. Symp. Physical Design, San Francisco, CA, 2005, pp. 216-220.
20. D. M. Schuler and E. G. Ulrich, "Clustering and linear placement," in Proc. ACM/IEEE Design Automation Conf., Dallas, TX, 1972, pp. 50-56.
21. W.-J. Sun and C. Sechen, "Efficient and effective placement for very large circuits," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 14, no. 3, pp. 349-359, Mar. 1995.
22. N. Viswanathan and C.-N. Chu, "FastPlace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model," in Proc, ACM/IEEE Int. Symp, Physical Design, Phoenix, AZ, 2004, pp. 26-33.
23. J. Vygen, "Algorithms for large-scale flat placement," in Proc. ACM/IEEE Design Automation Conf., Anaheim, CA, 1997, pp. 746-751.
24. M. Wang, X. Yang, and M. Sarrafzadeh, "DRAGON2000: Standard-cell placement tool for large industry circuits," in Proc. IEEE Int. Conf. Computer-Aided Design, San Jose, CA, 2001, pp. 260-263.
25. M. Yildiz and P. Madden, "Global objectives for standard-cell placement," in Proc.. IEEE Great Lakes Symp. VLSI, West Lafayette, IN, 2001, pp. 68-72.