skip to main content
research-article

Eh?Legalizer: A High Performance Standard-Cell Legalizer Observing Technology Constraints

Published: 09 May 2018 Publication History

Abstract

The legalization step is performed after global placement where wire length and routability are optimized or during timing optimization where buffer insertion or gate sizing are applied to meet timing requirements. Therefore, an ideal legalization approach must preserve the quality of the input placement in terms of routability, wire length, and timing constraints. These requirements indirectly impose maximum and average cell movement constraints during legalization. In addition, the legalization step should effectively manage white space availability with a highly efficient runtime in order to be used in an iterative process such as timing optimization. In this article, a robust and fast legalization method called Eh?Legalizer for standard-cell placement is presented. Eh?Legalizer legalizes input placements while minimizing the maximum and average cell movements using a highly efficient novel network flow-based approach. In contrast to the traditional network flow-based legalizers, areas with high cell utilizations are effectively legalized by finding several candidate paths and there is no need for a post-process step. The experimental results conducted on several benchmarks show that Eh?Legalizer results in 2.5 times and 3.3 times less the maximum and average cell movement, respectively, while its runtime is significantly (18×) lower compared to traditional legalizers. In addition, the experimental results illustrate the scalability and robustness of Eh?Legalizer with respect to the floorplan complexity. Finally, the detailed-routing results show detailed-routing violations are reduced on average by 23% when Eh?Legalizer is used to generate legal solutions.

References

[1]
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River, NJ.
[2]
U. Brenner. 2013. BonnPlace legalization: Minimizing movement by iterative augmentation. IEEE TCAD 32, 8 (Aug. 2013), 1215--1227.
[3]
Ismail S. Bustany, David Chinnery, Joseph R. Shinnerl, and Vladimir Yutsi. 2015. ISPD 2015 benchmarks with fence regions and routing blockages for detailed-routing-driven placement. In Proc. of ISPD. 157--164.
[4]
Cadence, Inc. 2009. LEF/DEF version 5.3-5.7 exchange format. Retrieved Jan. 1, 2015 from http://www.si2.org/openeda.si2.org/projects/lefdef.
[5]
Minsik Cho, Haoxing Ren, Hua Xiang, and Ruchir Puri. 2010. History-based VLSI legalization using network flow. In Proc. of DAC. 286--291.
[6]
W.-K. Chow, J. Kuang, X. He, W. Cai, and Evangeline F. Y. Young. 2014. Cell density-driven detailed placement with displacement constraint. In Proc. of ISPD. 3--10.
[7]
Nima Karimpour Darav, Andrew Kennings, David Westwick, and Laleh Behjat. 2015. High performance global placement and legalization accounting for fence regions. In Proc. of ICCAD. 514--519.
[8]
E. W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 1 (Dec. 1959), 269--271.
[9]
D. Hill. 2002. Method and system for high speed detailed placement of cells within an integrated circuit design. (March 22, 1999). US Patent 6,370,673 (April 9, 2002).
[10]
Chau-Chin Huang, Hsin-Ying Lee, Bo-Qiao Lin, Sheng-Wei Yang, Chin-Hao Chang, Szu-To Chen, and Yao-Wen Chang. 2015. Detailed-routability-driven analytical placement for mixed-size designs with technology and region constraints. In Proc. of ICCAD. Piscataway, NJ, 508--513.
[11]
Andrew B. Kahng, Igor L. Markov, and Sherief Reda. 2004. On legalization of row-based placements. In Proc. of GLSVLSI. 214--219.
[12]
N. Karimpour Darav, A. Kennings, A. Fakheri Tabrizi, D. Westwick, and L. Behjat. 2016. Eh?placer: A high-performance modern technology-driven placer. ACM TODAES 21, 3 (April 2016), Article 37, 27 pages.
[13]
Andrew Kennings, Nima Karimpour Darav, and Laleh Behjat. 2014. Detailed placement accounting for technology constraints. In Proc. of VLSI-SoC. 1--6.
[14]
Myung-Chul Kim, Dongjin Lee, and Igor L. Markov. 2012. SimPL: An effective placement algorithm. IEEE TCAD 31, 1 (2012), 50--60.
[15]
M. C. Kim, N. Viswanathan, Z. Li, and C. Alpert. 2013. ICCAD-2013 CAD contest in placement finishing and benchmark suite. In Proc. of ICCAD. 268--270.
[16]
Tao Lin, Chris Chu, Joseph R. Shinnerl, Ismail Bustany, and Ivailo Nedelchev. 2015. POLAR: A high performance mixed-size wirelengh-driven placer with density constraints. IEEE TCAD 34, 3 (2015), 447--459.
[17]
Mentor Graphics, Inc. 2015. Olympus-SoC Place and Route for Advanced Node Designs. Technical Report. www.mentor.com/products/ic_nanometer_design/place-route/olympus-soc.
[18]
Gi-Joon Nam. 2006. ISPD 2006 placement contest: Benchmark suite and results. In Proc. of ISPD. 167--167.
[19]
H. Ren, D. Z. Pan, C. J. Alpert, and P. Villarrubia. 2005. Diffusion-based placement migration. In Proc. of DAC. 515--520.
[20]
S. S. Skiena. 2008. The Algorithm Design Manual (2nd ed.). Springer Publishing Company, Incorporated.
[21]
Peter Spindler, Ulf Schlichtmann, and Frank M. Johannes. 2008. Abacus: Fast legalization of standard cell circuits with minimal movement. In Proc. of ISPD. 47--53.
[22]
N. Viswanathan, Min Pan, and C. Chu. 2007. FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In Proc. of ASP-DAC. Washington, DC, 135--140.
[23]
Chun-Kai Wang, Chuan-Chia Huang, Sean Shih-Ying Liu, Ching-Yu Chin, Sheng-Te Hu, Wei-Chen Wu, and Hung-Ming Chen. 2015. Closing the gap between global and detailed placement: Techniques for improving routability. In Proc. of ISPD. 149--156.
[24]
Vladimir Yutsis, Ismail S. Bustany, David Chinnery, Joseph R. Shinnerl, and Wen-Hao Liu. 2014. ISPD 2014 benchmarks with sub-45Nm technology rules for detailed-routing-driven placement. In Proc. of ISPD. 161--168.

Cited By

View all
  • (2024)A Robust Newton Iteration Method for Mixed-Cell-Height Circuit Legalization Under Technology and Region ConstraintsACM Transactions on Design Automation of Electronic Systems10.1145/368943629:6(1-25)Online publication date: 22-Aug-2024
  • (2024)NGLIC: A Nonaligned-Row Legalization Approach for 3-D Interdie ConnectionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.331779443:2(404-416)Online publication date: 1-Feb-2024
  • (2023)An accelerated modulus-based matrix splitting iteration method for mixed-size cell circuits legalizationIntegration, the VLSI Journal10.1016/j.vlsi.2022.08.01088:C(20-31)Online publication date: 1-Jan-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Design Automation of Electronic Systems
ACM Transactions on Design Automation of Electronic Systems  Volume 23, Issue 4
Special Section on Advances in Physical Design Automation and Regular Papers
July 2018
316 pages
ISSN:1084-4309
EISSN:1557-7309
DOI:10.1145/3217208
  • Editor:
  • Naehyuck Chang
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

Publication History

Published: 09 May 2018
Accepted: 01 October 2017
Revised: 01 August 2017
Received: 01 May 2017
Published in TODAES Volume 23, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Legalization
  2. fence regions
  3. network flows
  4. placement
  5. target density

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • Natural Sciences and Engineering Council of Canada (NSERC)
  • Canadian Microelectronics Corporation (CMC)
  • Mentor Graphics Corporation
  • Alberta Innovates-Technology Futures (AITF)

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)20
  • Downloads (Last 6 weeks)2
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2024)A Robust Newton Iteration Method for Mixed-Cell-Height Circuit Legalization Under Technology and Region ConstraintsACM Transactions on Design Automation of Electronic Systems10.1145/368943629:6(1-25)Online publication date: 22-Aug-2024
  • (2024)NGLIC: A Nonaligned-Row Legalization Approach for 3-D Interdie ConnectionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.331779443:2(404-416)Online publication date: 1-Feb-2024
  • (2023)An accelerated modulus-based matrix splitting iteration method for mixed-size cell circuits legalizationIntegration, the VLSI Journal10.1016/j.vlsi.2022.08.01088:C(20-31)Online publication date: 1-Jan-2023
  • (2022)A Robust Two-Step Modulus-Based Matrix Splitting Iteration Method for Mixed-Size Cell Circuit Legalization ProblemJournal of Circuits, Systems and Computers10.1142/S021812662350129332:08Online publication date: 19-Nov-2022
  • (2022)An Accelerated Mixed-Height Cell Circuit Legalization MethodJournal of Physics: Conference Series10.1088/1742-6596/2221/1/0120312221:1(012031)Online publication date: 1-May-2022
  • (2021)OptiPlace: optimized placement solution for mixed-size designsAnalog Integrated Circuits and Signal Processing10.1007/s10470-021-01864-5Online publication date: 13-May-2021
  • (2020)Mixed-cell-height Legalization Considering Technology and Region ConstraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.2976674(1-1)Online publication date: 2020
  • (2019)Multi-Commodity Flow-Based Spreading in a Commercial Analytic PlacerProceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays10.1145/3289602.3293896(122-131)Online publication date: 20-Feb-2019
  • (2019)A shape-driven spreading algorithm using linear programming for global placementProceedings of the 24th Asia and South Pacific Design Automation Conference10.1145/3287624.3287675(563-568)Online publication date: 21-Jan-2019
  • (2018)Improved Parallel Legalization Schemes for Standard Cell Placement with ObstaclesTechnologies10.3390/technologies70100037:1(3)Online publication date: 22-Dec-2018

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media