Journal of the Institute of Electronics Engineers of Korea SD (대한전자공학회논문지SD)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

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)
  • 성영태 (동아대학교 컴퓨터공학과) ;
  • 허성우 (동아대학교 컴퓨터공학과)
  • Published : 2005.12.01
Download PDF
⟨ Previous Next ⟩

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.

본 논문에서는 "middle-down" 접근법에 기반한 기존의 표준 셀 배치기인 하이브리드 배치기$^{[25]}$의 단점을 보완한 효율적인 광역배치 알고리즘을 제안한다. hMETIS(클러스터링을 이용한 다단계 하이퍼그래프 분할기법)에 사용된 기법과 RBLS(Relaxation Based Local Search) 기법의 적절한 조합을 통해 기존 하이브리드 배치기의 광역배치 기능을 향상시킨다. hMETIS를 통한 분할기법을 "top-down" 방식으로 적용하고, 각 단계에서 RBLS를 사용하여 광역배치를 점진적으로 개선해 나가는 제안된 기법은 초기 배치에 크게 영향을 받는 기존 방법의 문제점을 해결하고, 실행 속도를 개선하면서도 배치의 질을 떨어뜨리지 않는 효과적인 기법이다. 제안한 알고리즘을 통해 구현된 개선된 배치기는 기존의 하이브리드 배치기나 FengShui와 같은 우수한 툴과 비교할 때 뒤지지 않는 성능을 보인다. 특별히 기존의 하이브리드 배치기에 비해 실행 속도 면에서 평균 5배 정도의 개선을 보였고, 큰 회로에 대해선 배선길이도 줄어드는 향상된 결과를 보였다.

Keywords

References

  1. P. Villarrubia, 'Important Placement Considerations for Modem VLSI Chips,' Proc. of ISPD, pp.6, 2003
  2. 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
  3. M. Sarrafzadeh and M. Wang, 'NRG: global and detailed placement,' Proc. of ICCAD, pp.532-537, 1997
  4. C. Sechen and K. W. Lee, 'An Improved Simulated Annealing Algorithm for Row-Based Placement,' Proc. of ICCAD, pp. 478-481, 1987
  5. X. Yang, M. Wang, K. Eguro, and M. Sarrafzadeh, 'A snap-on placement tool,' Proc. of ISPC, pp.153-158, 2000 https://doi.org/10.1145/332357.332392
  6. A. E. Caldwell, A. B. Kahng, and Igor L. Markov, 'Can Recursive Bisection Alone Produce Routable Placements?,' Proc. of DAC, pp.477-482, 2000 https://doi.org/10.1145/337292.337549
  7. 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 https://doi.org/10.1145/267665.267674
  8. M. C. Yildiz and P. H. Madden, 'Improved Cut Sequences for Partitioning Based Placement,' Proc. of DAC, pp.776-779, 2001 https://doi.org/10.1145/378239.379064
  9. Ke Zhong, and Shantanu Dutt, 'Effective Partition-Driven Placement with Simultaneous Level Processing and Global Net Views,' Proc. of ICCAD, pp. 254-259, 2000 https://doi.org/10.1109/ICCAD.2000.896482
  10. Jason Cong, Michail Romesis, and Min Xie, 'Optimality, Scalability, and Stability Study of Partitioning and Placement Algorithms,' Proc. of ISPD, pp.88-94, 2003 https://doi.org/10.1145/640000.640021
  11. 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 https://doi.org/10.1145/299996.300032
  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 https://doi.org/10.1002/j.1538-7305.1970.tb01770.x
  13. C. M. Fiduccia and R. M. Mattheyses, 'A Linear-Time Heuristic for Improving Network Partitions,' Proc, of DAC, pp. 175-181, 1982
  14. H. Eisenmann and F. M. Johannes, 'Generic Global Placement and Floorplanning,' Proc. of DAC, pp.269-274, 1998 https://doi.org/10.1145/277044.277119
  15. 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 https://doi.org/10.1145/640000.640016
  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 https://doi.org/10.1109/TCAD.2005.846365
  17. 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
  18. P. N. Parakh, R. B. Brown, and K. A. Sakallah, 'Congestion Driven Quadratic Placement,' Proc. of the 35th DAC, pp. 275-278, 1998 https://doi.org/10.1145/277044.277121
  19. 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
  20. H. Etawil, S. Areibi, and A. Vannelli, 'Attractor-Repeller Approach for Global Placement,' Proc. of ICCAD, pp.20-24, 1999 https://doi.org/10.1109/ICCAD.1999.810613
  21. M. Wang, X. Yang, and M. Sarrafzadeh, 'Dragon2000: Standard-Cell Placement Tool for Large Industry Circuits,' Proc. of ICCAD, pp.260-263, 2000 https://doi.org/10.1109/ICCAD.2000.896483
  22. 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 https://doi.org/10.1109/ICCD.2002.1106746
  23. R.-M. Kling and P. Banerjee, 'ESP: A New Standard Cell Placement Package Using Simulated Evolution,' Proc. of DAC, pp. 60-66, 1987 https://doi.org/10.1145/37888.37897
  24. T. Chan, J. Cong, T. Kong, and J. Shinnerl, 'Multilevel Optimization for Large-Scale Circuit Placement.' Proc. of ICCAD, pp.171-176, 1999 https://doi.org/10.1109/ICCAD.2000.896469
  25. 허성우, 오은경, '표준 셀 배치를 위한 하이브리드 기법,' 정보과학회 논문지: 시스템 이론, Vol.30, No.9.10, pp.595-602, 2003
  26. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, 'Multilevel Hypergraph Partitioning: Application in VLSI Domain,' Proc. of DAC, pp.526-529, 1997 https://doi.org/10.1145/266021.266273
  27. 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
  28. 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 https://doi.org/10.1145/640000.640022
  29. http://vlsicad.eecs.umich.edu/BK