FastPlace: Efficient analytical placement using cell shifting, iterative local refinement, and a hybrid net model

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

Volumn 24, Issue 5, 2005, Pages 722-733

  Viswanathan, Natarajan ^a   Chu, Chris Chong Nuen ^a  

^a Iowa State University of Science and Technology   (United States)

Author keywords

Analytical placement; Computer aided design; Net models; Standard cell placement

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTER AIDED DESIGN; INTEGRATED CIRCUIT LAYOUT; MICROPROCESSOR CHIPS; QUADRATIC PROGRAMMING;

ANALYTICAL PLACEMENT; NET MODELS; STANDARD CELL PLACEMENT; WIRELENGTH MINIMIZATION;

LSI CIRCUITS;

EID: 18744381616     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2005.846365     Document Type: Article

References (32)

1. R. Varadarajan, "Convergence of placement technology in physical synthesis: Is placement really a point tool?," in Proc. Int. Symp. Phys. Design, 2003, p. 7.
2. P. Villarrubia, "Important placement considerations for modern VLSI chips," in Proc. Int. Symp. Phys. Design, 2003, p. 6.
3. The International Technology Roadmap for Semiconductors, 2000.
4. C.-C. Chang, J. Cong, and M. Xie, "Optimality and scalability study of existing placement algorithms," in Proc. Asian South Pacific Design Automation Conf., 2003, pp. 621-627.
5. J. Cong, M. Romesis, and M. Xie, "Optimality, scalability, stability study of partitioning, and placement algorithms," in Proc. Int. Symp. Phys. Design, 2003, pp. 88-94.
6. A. B. Kahng and Q. Wang, "Implementation and extensibility of an analytical placer," in Proc. Int. Symp. Phys. Design, 2004, pp. 18-25.
7. H. Eisenmann and F. Johannes, "Generic global placement and floorplanning," in Proc. ACM/IEEE Design Automation Conf., 1998, pp. 269-274.
8. H. Etawil, S. Arebi, and A. Vannelli, "Attractor-repeller approach for global placement," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 1999, pp. 20-24.
9. B. Hu and M. Marek-Sadowska, "FAR: Fixed-points addition and relaxation based placement," in Proc. Int. Symp. Phys. Design, 2002, pp. 161-166.
10. J. Kleinhans, G. Sigl, F. Johannes, and K. Antreich, "GORDIAN: VLSI placement by quadratic programming and slicing optimization," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 10, no. 3, pp. 356-365, Mar. 1991.
11. G. Sigl, K. Doll, and F. Johannes, "Analytical placement: A linear or a quadratic objective function," in Proc. ACM/IEEE Design Automation Conf., 1991, pp. 427-431.
12. S.-W. Hur, T. Cao, K. Rajagopal, Y. Parasuram, A. Chowdhary, V. Tiourin, and B. Halpin, "Force directed mongrel with physical net constraints," in Proc. ACM/IEEE Design Automation Conf., 2003, pp. 214-219.
13. J. Vygen, "Algorithms for large-scale flat placement," in Proc. ACM/IEEE Design Automation Conf., 1997, pp. 746-751.
14. C. Sechen and A. L. Sangiovanni-Vincentelli, "TimberWolf 3.2: A new standard cell placement and global routing package," in Proc. ACM/IEEE Design Automation Conf., 1986, pp. 432-439.
15. M. Wang, X. Yang, and M. Sarrafzadeh, "Dragon2000: Standard-cell placement tool for large industry circuits," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 2000, pp. 260-263.
16. A. E. Caldwell, A. B. Kahng, and I. L. Markov, "Can recursive bisection produce routable placements," in Proc. ACM/IEEE Design Automation Conf., 2000, pp. 477-482.
17. 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. 2000, pp. 171-176.
18. M. C. Yildiz and P. H. Madden, "Global objectives for standard cell placement," in Proc. 11th Great Lakes Symp. VLSI, 2001, pp. 68-72.
19. B. Hu and M. Marek-Sadowska, "Fine granularity clustering for large scale placement problems," in Proc. Int. Symp. Phys. Design, 2003, pp. 67-74.
20. C. M. Fiduccia and R. M. Mattheyses, "A linear-time heuristic for improving network partitions," in Proc. ACM/IEEE Design Automation Conf., 1982, pp. 175-181.
21. S.-W. Hur and J. Lillis, "Mongrel: Hybrid techniques for standard cell placement," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 2000, pp. 165-170.
22. W. Naylor et al., "Non-Linear Optimization System and Method for Wire Length and Delay Optimization for an Automatic Electric Circuit Placer," U.S. Patent 6301693, Oct. 2001.
23. F. Mo, A. Tabbara, and R. Brayton, "A force-directed macro-cell placer," in Proc. IEEE/ACM Int. Conf. Computer-Aided Design, 2000, pp. 177-180.
24. K. M. Hall, "An r-dimensional quadratic placement algorithm," Manage. Sci., vol. 17, pp. 219-229, 1970.
25. D. S. Kershaw, "The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations," J. Comp. Phys., vol. 26, pp. 43-65, 1978.
26. R. Barren et al., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd ed. Philadelphia, PA: SIAM, 1994.
27. ISPD02 IBM-MS Mixed-Size Placement Benchmarks, S. N. Adya and I. L. Markov. [Online]. Available: http://vl-sicad.eecs.umich.edu/BK/ISPD02bench/
28. _, "Consistent placement of macro-blocks using floorplanning and standard-cell placement," in Proc. Int. Symp. Phys. Design, 2002, pp. 12-17.
29. PEKO Placement Benchmark Suite, J. Cong, C.-C. Chang, and M. Xie. [Online]. Available: http://ballade.cs.ucla.edu/pubbench/
30. ISPD04 IBM Standard Cell Benchmarks with Pads, N. Viswanathan and C. C.-N. Chu. [Online]. Available: http://www.public.iastate.edu/nataraj/ ISPD04_Bench.html
31. K. Doll, F. M. Johannes, and K. J. Antreich, "Iterative placement improvement by network flow methods," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 13, no. 10, pp. 1189-1200, Oct. 1994.
32. H. Chen, C.-K. Cheng, N.-C. Chou, A. Kahng, J. MacDonald, P. Suaris, B. Yao, and Z. Zhu, "An algebraic multigrid solver for analytical placement with layout based clustering," in Proc. ACM/IEEE Design Automation Conf., 2003, pp. 794-799.