Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Hybrid Techniques for Standard Cell Placement

표준 셀 배치를 위한 하이브리드 기법

  • 허성우 (동아대학교 전기전자컴퓨터공학부) ;
  • 오은경 (동아대학교 컴퓨터공학과)
  • Published : 2003.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

This Paper presents an efficient hybrid techniques for a standard cell placement. The prototype tool adopts a middle-down methodology in which an n${\times}$m grid is imposed over the layout area and cells are assigned to bins forming a global placement. The optimization technique applied in this phase is based on the Relaxation-Based Local Search (RBLS) framework [12］in which a combinatorial search mechanism is driven by an analytical engine. This enables a more global view of the problem and results in complex modifications of the placement in a single search“move.”Details of this approach including a novel placement legalization procedure are presented. When a global placement converges, a detailed placement is formed and further optimized by the optimal interleaving technique[13］. Experimental results on MCNC benchmarking circuits are presented and compared with the Feng Shui's results in［14］. Solution Qualifies are almost the same as the Feng Shui's results.

본 논문은 표준 셀을 효율적으로 배치하는 하이브리드 기법을 제시한다. 제시한 기법에서는 레이아웃 영역을 n${\times}$m 그리드로 분할하고, 분할된 그리드의 각 빈에 셀을 배치함으로 광역 배치를 얻는다. 광역배치를 얻은 후 Relaxation-Based Local Search (RBLS)라 불리는 해석적 최적 기법[12］을 사용하여 배치를 개선시킨다. 이 기법을 사용하면 배치 전체를 개괄적으로 볼 수 있게 되어 배치가 국부 최적에 빠지지 않도록 할 수 있다. 이 기법의 핵심은 중복을 해결하기 위한 매우 효율적인 적법화 알고리즘이라고 볼 수 있는데, 이에 대해 본 논문은 자세히 설명한다. 광역배치가 더 이상 개선되지 않으면 이를 상세 배치로 변환시킨다. 상세 배치를 얻은 후“최적 인터리빙”이라 불리는 기법[13］을 사용하여 이를 더욱 개선시킨다. MCNC 벤치마킹 회로에 대한 실험 결과는［14]에서 보여준 Feng Shui의 결과와 필적할 만하다.

Keywords

References

  1. M. Wang and M. Sarrafzadeh, 'Behavior of Congestion Minimization During Placement,' in Proc. of International Symposium on Physical Design, pp. 145-150, 1999 https://doi.org/10.1145/299996.300044
  2. M. A. Breuer, 'Min-cut Placement,' Design Automation and Fault-Tolerant Computing, pp. 343-382, 1977
  3. A. E. Caldwell, A. B. Kahng and I. L. Markov, 'Optimal End-Case Partitioners and Placers for Standard-Cell Layout,' in Proc. of International Symposium on Physical Design, pp. 90-96, 1999 https://doi.org/10.1145/299996.300032
  4. D. J. H. Huang and Andrew B. Kahng, 'Partitioning-Based Standard-Cell Global Placement with an Exact Objective,' in Proc. of International Symposium on Physical Design, pp. 18-25, 1997 https://doi.org/10.1145/267665.267674
  5. C. M. Fiduccia and R. M. Mattheyses, 'A Linear Time Heuristic for Improving Network Partitions,' in Proc. of ACM/IEEE Design Automation Conference, pp. 175-181, 1982
  6. C. Sechen and K. W. Lee, 'An Improved Simulated Annealing Algorithm for Row-Based Placement,' in Proc. of IEEE International Conference on Coumputer-Aided Design, pp. 478-481, 1987
  7. Wern-Jieh Sun and Carl Sechen, 'Efficient and Effective Placement for Very Large Circuits,' IEEE Transactions on Computer-Aided Design, pp. 349-359, 1995 https://doi.org/10.1109/43.365125
  8. Sivanarayana Mallela and Lov K. Grover, 'Clustering Based Simulated Annealing for Standard Cell Placement,' in Proc. of Design Automation Conference, pp. 312-317, 1988 https://doi.org/10.1109/DAC.1988.14776
  9. Majid Sarrafzadeh and Maogang Wang, 'NRG:Global and Detailed Placement,' in Proc. of IEEE International Conference on Coumputer-Aided Design, pp. 532-537, 1997 https://doi.org/10.1109/ICCAD.1997.643590
  10. G. Sigl, K. Doll and F Johannes, 'Anylytical Placement: A Linear or a Quadratic Objective Function?,' in Proc. of ACM/IEEE Design Automation Conference, pp. 427-432, 1991
  11. H. Eisenmann and F. M. Johannes, 'Generic Global Placement and Floorplanning,' in Proc. of ACM/IEEE Design Automation Conference, pp. 296-274, 1998 https://doi.org/10.1145/277044.277119
  12. Sung-Woo Hur and John Lillis, 'Relaxation and Clustering in a Local Search Framework: Application to Linear Placement,' VLSI Design, Vol. 14, No. 2, pp. 143-154, 2002 https://doi.org/10.1080/10655140290010060
  13. 오은경, 허성우, '동적 프로그래밍 기법을 이용한 효율적인 배치 개선 알고리즘,' 한국정보처리학회 추계학술발표대회, 2002
  14. Patrick H. Madden, 'Reporting of Standard Cell Placement Results,' IEEE Trans. of CAD, pp. 240-247, 2002 https://doi.org/10.1109/43.980262
  15. GSRC Bookshelf slot [online] 'http://www.gagascale.org/bookshelf.'
  16. IEEE Trans. of CAD Reporting of Standard Cell Placement Results Patrick H. Madden
  17. Bookshelf slot GSRC