Browse > Article

Effective Global Placement Technique Using Quadratic Programming  

Kim Dong-Hyun (Department of Computer Eng., Dong-A University)
Hur Sung-Woo (Department of Computer Eng., Dong-A University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SD / v.43, no.6, 2006 , pp. 23-29 More about this Journal
Abstract
In this paper, we propose an effective global placement technique using quadratic programming(QP). In order to resolve cell congestion problem which is a drawback of QP based placement techniques, additional force and grid pre-warping technique are used. We devised a new density function for evaluating proper additional force which depends on density. Grid pre-warping technique relocates cells over entire area according to the relative ordering between coordinates of cells. Using the additional force obtained by the new density function and applying the pre-warping technique iteratively we obtained a well-distributed global placement. Mongrel which is a middle-down methodology based placer takes such a good global placement as an initial placement and produces a final detailed placement. Experimental results show that proposed technique outperforms the FM algorithm based global placement and are comparable with the well-known leading placers, FengShui, Dragon.
Keywords
quadratic programming; placement;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, 'Multilevel Hypergraph Partitioning: Application in VLSI Domain,' Proc. of DAC, pp.526-529, 1997   DOI
2 http://er.cs.ucla.edu/Dragon/gsrcmcnc-dragon.html
3 성영태, '효과적인 초기 배치를 이용한 개선된 Mongrel,' 석사논문, 동아대학교 컴퓨터공학과, 2003년 12월
4 Sung-Woo Hur and John Lillis, 'Mongrel: hybrid techniques for standard cell placement,' Proc. of ICCAD, pp.165-170, 2000   DOI
5 http://visicad.eecs.umich.edu/BK
6 ISPD04 IBM-MS Mixed-Size Placement Benchmarks, S. N. Adya and I. L. Markov. http://vlsicad.eecs.umich.edu/BK/ISPD04bench/
7 A. E. Caldwell, A. B. Kahng, and I. L. Markov, 'Optimal Partitioners and End-Case Placers for Standard-Cell Layout,' Proc. of ISPD, pp. 90-96, 1999   DOI
8 Zhong Xiu, James D. Ma, Suzanne M. Fowler, Rob A. Rutenbar, 'Large-Scale Placement by Grid-Warping,' Proc. of DAC, pp.351-356, 2004   DOI
9 Sung-Woo Hur and John Lillis, 'Relaxation and Clustering in a Local Search Framework: Application to Linear Placement,' Proc. of DAC, pp.360- 366, 1999   DOI
10 M. Wang, X. Yang, and M. Sarrafzadeh, 'Dragon2000: Standard-Cell Placement Tool for Large Industry Circuits,' Proc. of ICCAD, pp.260-263, 2000   DOI
11 C. J. Alpert and A. B. Kahng, 'A General Framework for Vertex Orderings, with Applications to Netlist Clustering,' Proc. of ICCAD, pp.63-67, 1994
12 B. W. Kernighan, and S. Lin, 'An Efficient Heuristic Procedure for Partitioning Graphs,' Bell Syst. Tech, vol.49, no.2, pp.291- 308, 1970
13 C. Sechen and A. Sangiovanni-Vincentelli, 'TimberWolf3.2: A New Standard Cell Placement and Global Routing Package,' Proc. of the DAC, pp.432-439, 1986
14 C. M. Fiduccia and R. M. Mattheyses, 'A Linear- Time Heuristic for Improving Network Partitions,' Proc of DAC, pp. 175-181, 1982
15 H. Eisenmann and F. M. Johannes, 'Generic Global Placement and Floorplanning,' Proc. of DAC, pp.269-274, 1998   DOI
16 N. Viswanathan and Chris C. Chu, 'FastPlace: Efficient Analytical Placement Using Cell Shifting, Iterative Local Refinement and a Hybrid Net Model,' IEEE Trans. CAD of Integrated Circuits and Systems, vol.24, no.5, pp.722-733, 2005   DOI   ScienceOn
17 Patrick H. Madden, 'Reporting of Standard Cell Placement Results,' IEEE Trans. of CAD, pp.240-247, 2002   DOI   ScienceOn
18 A. E. Caldwell, A. B. Kahng, and Igor L,. Markov, 'Can Recursive Bisection Alone Produce Routable Placements?,' Proc. of DAC, pp.477-482, 2000   DOI
19 P. Villanubia, 'Important Placement Considerations for Modem VLSI Chips,' Proc. of ISPD, pp.6, 2003