Browse > Article

Efficient Global Placement Using Hierarchical Partitioning Technique and Relaxation Based Local Search  

Sung Young-Tae (Dept. of Computer Engineering, Dong-A University)
Hur Sung-Woo (Dept. of Computer Engineering, Dong-A University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SD / v.42, no.12, 2005 , pp. 61-70 More about this Journal
Abstract
In this paper, we propose an efficient global placement algorithm which is an enhanced version of Hybrid Placer$^{[25]}$, a standard cell placement tool, which uses a middle-down approach. Combining techniques used in the well-known partitioner hMETIS and the RBLS(Relaxation Based Local Search) in Hybrid Placer improves the quality of global placements. Partitioning techniques of hMETIS is applied in a top-down manner and RBLS is used in each level of the top-down hierarchy to improve the global placement. The proposed new approach resolves the problem that Hybrid Placer seriously depends on initial placements and it speeds up without deteriorating the placement quality. Experimental results prove that solutions generated by the proposed method on the MCNC benchmarks are comparable to those by FengShui which is a well known placement tool. Compared to the results of the original Hybrid Placer, new method is 5 times faster on average and shows improvement on bigger circuits.
Keywords
hMETIS; RBLS;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
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 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
3 S. N. Adya, M. C. Yildiz, I. L. Markov, P. G. Villarrubia, P. N. Parakh, and P. H. Madden, 'Benchmarking for Large-Scale Placement and Beyond,' Proc. of ISPD, pp. 95-103, 2003   DOI
4 http://vlsicad.eecs.umich.edu/BK
5 R.-M. Kling and P. Banerjee, 'ESP: A New Standard Cell Placement Package Using Simulated Evolution,' Proc. of DAC, pp. 60-66, 1987   DOI
6 T. Chan, J. Cong, T. Kong, and J. Shinnerl, 'Multilevel Optimization for Large-Scale Circuit Placement.' Proc. of ICCAD, pp.171-176, 1999   DOI
7 허성우, 오은경, '표준 셀 배치를 위한 하이브리드 기법,' 정보과학회 논문지: 시스템 이론, Vol.30, No.9.10, pp.595-602, 2003   과학기술학회마을
8 X. Yang, B.-K. Choi, and M. Sarrafzadeh, 'Routability Driven White Space Allocation for Ffixed-Die Standard-Cell Placement,' Proc. of ISPD, pp.42-47, 2002
9 M. Wang, X. Yang, and M. Sarrafzadeh, 'Dragon2000: Standard-Cell Placement Tool for Large Industry Circuits,' Proc. of ICCAD, pp.260-263, 2000   DOI
10 X. Yang, B.-K. Choi and M. Sarrafzadeh, 'A Standard-Cell Placement Tool for Designs with High Row Utilization,' Proc. of the 2002 IEEE International Conference on Computer Design, pp.45-49, 2002   DOI
11 H. Etawil, S. Areibi, and A. Vannelli, 'Attractor-Repeller Approach for Global Placement,' Proc. of ICCAD, pp.20-24, 1999   DOI
12 P. N. Parakh, R. B. Brown, and K. A. Sakallah, 'Congestion Driven Quadratic Placement,' Proc. of the 35th DAC, pp. 275-278, 1998   DOI
13 Karthik Rajagopal, Tal Shaked, Yegna Parasuram, Tung Cao, Amit Chowdhary, Bill Halpin, 'Timing Driven Force Directed Placement with Physical Net Constraints,' Proc. of ISPD, pp. 60-66, 2003   DOI
14 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
15 S. Goto, 'An Efficient Algorithm for the Two-Dimensional Placement Problem m Electrical Circuit Layout,' IEEE Trans. on Circuits and Systems, vol.28-1, pp.12-18, 1981
16 H. Eisenmann and F. M. Johannes, 'Generic Global Placement and Floorplanning,' Proc. of DAC, pp.269-274, 1998   DOI
17 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
18 B. W. Kernighan, and S. Lin, 'An Efficient Heuristic Procedure for Partitioning Graphs,' Bell Syst. Tech., vol.49, no.2, pp.291-308, 1970   DOI
19 C. M. Fiduccia and R. M. Mattheyses, 'A Linear-Time Heuristic for Improving Network Partitions,' Proc, of DAC, pp. 175-181, 1982
20 M. C. Yildiz and P. H. Madden, 'Improved Cut Sequences for Partitioning Based Placement,' Proc. of DAC, pp.776-779, 2001   DOI
21 Ke Zhong, and Shantanu Dutt, 'Effective Partition-Driven Placement with Simultaneous Level Processing and Global Net Views,' Proc. of ICCAD, pp. 254-259, 2000   DOI
22 Jason Cong, Michail Romesis, and Min Xie, 'Optimality, Scalability, and Stability Study of Partitioning and Placement Algorithms,' Proc. of ISPD, pp.88-94, 2003   DOI
23 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
24 D. J.-H, Huang, and A. B. Kahng, 'Partitioning-Based Standard-Cell Global Placement with an Exact Objective,' Proc. of ISPD, pp.18-25, 1997   DOI
25 C. Sechen and K. W. Lee, 'An Improved Simulated Annealing Algorithm for Row-Based Placement,' Proc. of ICCAD, pp. 478-481, 1987
26 X. Yang, M. Wang, K. Eguro, and M. Sarrafzadeh, 'A snap-on placement tool,' Proc. of ISPC, pp.153-158, 2000   DOI
27 M. Sarrafzadeh and M. Wang, 'NRG: global and detailed placement,' Proc. of ICCAD, pp.532-537, 1997
28 P. Villarrubia, 'Important Placement Considerations for Modem VLSI Chips,' Proc. of ISPD, pp.6, 2003
29 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