research-article

History-based VLSI legalization using network flow

Authors:

Ruchir PuriAuthors Info & Claims

DAC '10: Proceedings of the 47th Design Automation Conference

Pages 286 - 291

https://doi.org/10.1145/1837274.1837347

Published: 13 June 2010 Publication History

Abstract

In VLSI placement, legalization is an essential step where the overlaps between gates/macros must be removed. In this paper, we introduce a history-based legalization algorithm with min-cost network flow optimization. We find a legal solution with the minimum deviation from a given placement to fully honor/preserve the initial placement, by solving a gate-centric network flow formulation in an iterative manner. In order to realize a flow into gate movements, we develop efficient techniques which solve an approximated Subset-sum problem. Over the iterations, we factor into our formulation the history which captures a set of likely-to-fail gate movements. Such a history-based scheme enables our algorithm to intelligently legalize highly complex designs. Experimental results on over 740 real cases show that our approach is significantly superior to the existing algorithms in terms of failure rate (no failure) as well as quality of results (55% less max-deviation).

References

[1]

A. Agnihotri, M. C. Yildiz, A. Khatkhate, A. Mathur, S. Ono, and P. H. Madden. Fractional cut: Improved recursive bisection placement. In Proc. Int. Conf. on Computer Aided Design, 2003.

Digital Library

[2]

U. Brenner, A. Pauli, and J. Vygen. Almost optimum placement legalization by minimum cost flow and dynamic programming. In Proc. Int. Symp. on Physical Design, 2004.

Digital Library

[3]

U. Brenner and J. Vygen. Faster optimal single-row placement with fixed ordering. In Proc. Design, Automation and Test in Eurpoe, 2000.

Digital Library

[4]

U. Brenner and J. Vygen. Legalizing a placement with minimum total movement. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 23(12):1597--1613, Dec 2004.

Digital Library

[5]

T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang. NTUplace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 27(7):1228--1240, Jul 2008.

Digital Library

[6]

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001.

Digital Library

[7]

M. R. Garey, R. E. Tarjan, and G. T. Wilfong. One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res., 13(2), 1988.

Digital Library

[8]

A. V. Goldberg. An Effcient Implementation of a Scaling Minimum-Cost Flow Algorithmn. Journal of Algorithms, 22:1--29, 1997.

Digital Library

[9]

D. Hill. Method and system for high speed detailed placement of cells within an integrated circuit design". In U.S. Patent 6370673, Apr 2002.

[10]

S. W. Hur and J. Lillis. Mongrel: hybrid techniques for standard cell placement. In Proc. Int. Conf. on Computer Aided Design, 2000.

Digital Library

[11]

A. Kahng, P. Tucker, and A. Zelikovsky. Optimization of linear placements for wirelength minimization with free sites. In Proc. Asia and South Pacific Design Automation Conf., 1999.

[12]

T. Luo, H. Ren, C. J. Alpert, and D. Z. Pan. Computational geometry based placement migration. In Proc. Int. Conf. on Computer Aided Design, 2005.

Digital Library

[13]

D. Pisinger. Linear time algorithms for knapsack problems with bounded weights. Journal of Algorithms, 33:1--14, 1999.

Digital Library

[14]

H. Ren, D. Z. Pan, C. J. Alpert, and P. Villarrubia. Diffusion-based placement migration. In Proc. Design Automation Conf., 2005.

Digital Library

[15]

T. Taghavi, X. Yang, B.-K. Choi, M. Wang, and M. Sarrafzadeh. Dragon2006: blockage-aware congestion-controlling mixed-size placer. In Proc. Int. Symp. on Physical Design.

Digital Library

[16]

N. Viswanathan, M. Pan, and C. Chu. Fastplace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In Proc. Asia and South Pacific Design Automation Conf., 2007.

Digital Library

Cited By

Zhou CQiu JCao YYang GShen QShi Q(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
https://dl.acm.org/doi/10.1016/j.vlsi.2022.08.010
Dadaliaris AKranas GOikonomou PFloros GDossis M(2022)Exploiting Net Connectivity in Legalization and Detailed Placement ScenariosInformation10.3390/info1305021213:5(212)Online publication date: 20-Apr-2022
https://doi.org/10.3390/info13050212
Zhou CCao YShi QQiu J(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
https://doi.org/10.1142/S0218126623501293
Show More Cited By

Index Terms

History-based VLSI legalization using network flow
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)

Recommendations

A Fast, Robust Network Flow-based Standard-Cell Legalization Method for Minimizing Maximum Movement
ISPD '17: Proceedings of the 2017 ACM on International Symposium on Physical Design

The standard-cell placement legalization problem has become critical due to increasing design rule complexity and design utilization at 16nm and lower technology nodes. An ideal legalization approach should preserve the quality of the input placement in ...
On legalization of row-based placements
GLSVLSI '04: Proceedings of the 14th ACM Great Lakes symposium on VLSI

Cell overlaps in the results of global placement are guaranteed to prevent successful routing. However, common techniques for fixing these problems may endanger routing in a different way --- through increased wirelength and congestion. We evaluate ...
Almost optimum placement legalization by minimum cost flow and dynamic programming
ISPD '04: Proceedings of the 2004 international symposium on Physical design

VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, in a second step, the cells are moved to their final position such that all ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DAC '10: Proceedings of the 47th Design Automation Conference

June 2010

1036 pages

ISBN:9781450300025

DOI:10.1145/1837274

General Chair:
Sachin Sapatnekar
Univ. of Minnesota, Minneapolis, MN

Copyright © 2010 ACM.

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]

Sponsors

EDAC: Electronic Design Automation Consortium
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CEDA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

DAC '10

Sponsor:

EDAC
SIGDA

DAC '10: The 47th Annual Design Automation Conference 2010

June 13 - 18, 2010

California, Anaheim

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
273
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhou CQiu JCao YYang GShen QShi Q(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
https://dl.acm.org/doi/10.1016/j.vlsi.2022.08.010
Dadaliaris AKranas GOikonomou PFloros GDossis M(2022)Exploiting Net Connectivity in Legalization and Detailed Placement ScenariosInformation10.3390/info1305021213:5(212)Online publication date: 20-Apr-2022
https://doi.org/10.3390/info13050212
Zhou CCao YShi QQiu J(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
https://doi.org/10.1142/S0218126623501293
Chen JDi ZShi JFeng QWu Q(2022)NBLG: A Robust Legalizer for Mixed-Cell-Height Modern DesignIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2021.313700741:11(4681-4693)Online publication date: Nov-2022
https://doi.org/10.1109/TCAD.2021.3137007
Dadaliaris AKranas GOikonomou PDossis M(2021)Variations on a Connectivity-based Legalizer for Standard Cell Design2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)10.1109/SEEDA-CECNSM53056.2021.9566279(1-5)Online publication date: 24-Sep-2021
https://doi.org/10.1109/SEEDA-CECNSM53056.2021.9566279
Li XChen JZhu WChang YBustany ISwartz W(2019)Analytical Mixed-Cell-Height Legalization Considering Average and Maximum Movement MinimizationProceedings of the 2019 International Symposium on Physical Design10.1145/3299902.3309750(27-34)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3299902.3309750
Dhar SSinghal LIyer MPan DShibuya T(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
https://dl.acm.org/doi/10.1145/3287624.3287675
Oikonomou PDadaliaris AKolomvatsos KLoukopoulos TKakarountas AStamoulis G(2018)Improved Parallel Legalization Schemes for Standard Cell Placement with ObstaclesTechnologies10.3390/technologies70100037:1(3)Online publication date: 22-Dec-2018
https://doi.org/10.3390/technologies7010003
Darav NBustany IKennings AWestwick DBehjat L(2018)Eh?LegalizerACM Transactions on Design Automation of Electronic Systems10.1145/315821523:4(1-25)Online publication date: 9-May-2018
https://dl.acm.org/doi/10.1145/3158215
Oikonomou PDadaliaris ALoukopoulos TKakarountas AStamoulis G(2018)A Tetris-based legalization heuristic for standard cell placement with obstacles2018 7th International Conference on Modern Circuits and Systems Technologies (MOCAST)10.1109/MOCAST.2018.8376559(1-4)Online publication date: May-2018
https://doi.org/10.1109/MOCAST.2018.8376559
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten