Article

An effective congestion driven placement framework

Authors:

Ulrich Brenner,

André RoheAuthors Info & Claims

ISPD '02: Proceedings of the 2002 international symposium on Physical design

Pages 6 - 11

https://doi.org/10.1145/505388.505391

Published: 07 April 2002 Publication History

Abstract

We present a fast but reliable way to detect routing criticalities in VLSI chips. In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. Different to previous approaches, we do not rerun parts of the placement algorithm or apply a post-placement optimization, but we use our congestion estimator for a dynamic avoidance of routability problems in one single run of the placement algorithm. Computational experiments on chips with up to 1,300,000 cells are presented: The framework reduces the usage of the most critical routing edges by 9.0% on average, the running time increase for the placement is about 8.7%. However, due to the smaller congestion, the running time of routing tools can be decreased drastically, so the total time for placement and (global) routing is decreased by 47% on average.

References

[1]

C. Albrecht. Global routing by new approximation algorithms for multicommodity flow. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 20:622--632, 2001.

Digital Library

[2]

A. E. Caldwell, A. B. Kahng, and I. L. Markov. Can recursive bisection alone produce routable placements? In DAC-00, pages 477--482, 2000.

Digital Library

[3]

C.-L. E. Cheng. RISA: Accurate and efficient placement routability modeling. In ICCAD-94, pages 690--697. IEEE Computer Society Press, 1994.

Digital Library

[4]

H. Eisenmann and F. Johannes. Generic global placement and floorplanning. In DAC-98, pages 269--274, 1998.

Digital Library

[5]

W. Hou, H. Yu, X. Hong, Y. Cai, W. Wu, J. Gu, and W. H. Kao. A new congestion-driven placement algorithm based on cell inflation. In Proceedings on the 2001 conference on Asia and South Pacific design automation, pages 605--608. ACMPress, 2001.

Digital Library

[6]

D. Huang and A. Kahng. Partitioning-based standard-cell global placement with an exact objective, 1997.

Digital Library

[7]

P. Hung and M. J. Flynn. Stochastic congestion model for VLSI systems. Technical Report CSL-TR-97-737, Stanford University.

Digital Library

[8]

J. Lou, S. Krishnamoorthy, and H. S. Sheng. Estimating routing congestion using probabilistic analysis. In ISPD-01, pages 112--117. ACMPress, 2001.

Digital Library

[9]

S. Mayrhofer and U. Lauther. Congestion-driven placement using a new multi-partitioning heuristic. In ICCAD-90, pages 332--335. IEEE Computer Society Press, 1990.

[10]

Phiroze N. Parakh, Richard B. Brown, and Karem A. Sakallah. Congestion driven quadratic placement. In DAC-98, pages 275--278. ACM/IEEE, 1998.

Digital Library

[11]

S.M. Sait and H. Youssef. VLSI Physical Design Automation. World Scientific, 1999.

Digital Library

[12]

M. Sarrafzadeh and C. K. Wong. An Introduction to VLSI Physical Design. McGraw-Hill, 1996.

Digital Library

[13]

C. Sechen. VLSI Placement and Global Routing Using Simulated Annealing. Kluwer, 1988.

[14]

N. Sherwani. Algorithms for VLSI Physical Design Automation - 3rd Edition. Kluwer Academic Publishers, 1998.

Digital Library

[15]

J. Vygen. Algorithms for large-scale flat placement. In DAC-97, pages 746--751. ACM Press, 1997.

Digital Library

[16]

M. Wang and M. Sarrafzadeh. On the behavior of congestion minimization during placement. In ISPD-99, pages 145--150. ACM Press, 1999.

Digital Library

[17]

M. Wang and M. Sarrafzadeh. Modeling and minimization of routing congestion. In Proceedings on the 2000 conference on Asia and South Pacific design automation, pages 185--190. ACMPress, 2000.

Digital Library

[18]

M. Wang, X. Yang, K. Eguro, and M. Sarrafzadeh. Multi-center congestion estimation and minimization during placement. In ISPD-00, pages 147--152. ACM Press, 2000.

Digital Library

[19]

M. Wang, X. Yang, and M. Sarrafzadeh. Congestion minimization during placement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19, 2000.

Digital Library

[20]

M. Wang, X. Yang, and M. Sarrafzadeh. Dragon2000: Standard-cell placement tool for large industry designs, 2000.

[21]

D.F. Wong, H.W. Leong, and C.L. Liu. Simulated Annealing for VLSI Design. Kluwer, 1988.

Digital Library

[22]

X. Yang, R. Kastner, and M. Sarrafzadeh. Congestion estimation during top-down placement. In ISPD-01, pages 164--170. ACMPress, 2001.

Digital Library

[23]

X. Yang, R. Kastner, and M. Sarrafzadeh. Congestion reduction during placement with provably good approximation bound. In ICCAD-01, 2001.

Digital Library

Cited By

Karimullah SVishnuvardhan D(2022)Pin density technique for congestion estimation and reduction of optimized design during placement and routingApplied Nanoscience10.1007/s13204-021-02173-z13:3(1819-1828)Online publication date: 30-Jan-2022
https://doi.org/10.1007/s13204-021-02173-z
Datta PMukherjee S(2019)Routability-driven Placement for Mixed-size Designs using Design-hierarchy and Pin Information2019 International Conference on Automation, Computational and Technology Management (ICACTM)10.1109/ICACTM.2019.8776791(424-430)Online publication date: Apr-2019
https://doi.org/10.1109/ICACTM.2019.8776791
Kahng AKahng ALee HLi J(2018)PROBE: A Placement, Routing, Back-End-of-Line Measurement UtilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.275007237:7(1459-1472)Online publication date: Jul-2018
https://doi.org/10.1109/TCAD.2017.2750072
Show More Cited By

Index Terms

An effective congestion driven placement framework
1. Applied computing
  1. Arts and humanities
    1. Architecture (buildings)
      1. Computer-aided design
  2. Physical sciences and engineering
    1. Engineering
      1. Computer-aided design
2. Hardware
  1. Integrated circuits

Recommendations

An effective congestion-driven placement framework

We present a fast but reliable way to detect routing criticalities in very large scale integration chips. In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. Different to previous ...
A congestion-driven placement framework with local congestion prediction
GLSVLSI '05: Proceedings of the 15th ACM Great Lakes symposium on VLSI

In this paper, we present a novel congestion-driven placement methodology. We analyze netlist structure and perform local congestion prediction to determine the amount of white space which will be attached to each cell. We place the modified netlist ...
An enhanced congestion-driven floorplanner

In this paper, a rectilinear-based congestion-driven floorplanning algorithm is presented to enhance the wire congestion and the CPU runtime. The proposed algorithm contains two stages, including the simulated-annealing (SA) based approach with the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISPD '02: Proceedings of the 2002 international symposium on Physical design

April 2002

216 pages

ISBN:1581134606

DOI:10.1145/505388

General Chair:
Sachin Sapatnekar
University of Minnesota
,
Program Chair:
Massoud Pedram
USC

Copyright © 2002 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

SIGDA: ACM Special Interest Group on Design Automation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 April 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISPD02

Sponsor:

SIGDA

ISPD02: International Symposium on Physical Design

April 7 - 10, 2002

CA, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 62 of 172 submissions, 36%

Upcoming Conference

ISPD '25

Sponsor:
sigda

International Symposium on Physical Design

March 16 - 19, 2025

Austin , TX , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

73
Total Citations
View Citations
547
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)1

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Karimullah SVishnuvardhan D(2022)Pin density technique for congestion estimation and reduction of optimized design during placement and routingApplied Nanoscience10.1007/s13204-021-02173-z13:3(1819-1828)Online publication date: 30-Jan-2022
https://doi.org/10.1007/s13204-021-02173-z
Datta PMukherjee S(2019)Routability-driven Placement for Mixed-size Designs using Design-hierarchy and Pin Information2019 International Conference on Automation, Computational and Technology Management (ICACTM)10.1109/ICACTM.2019.8776791(424-430)Online publication date: Apr-2019
https://doi.org/10.1109/ICACTM.2019.8776791
Kahng AKahng ALee HLi J(2018)PROBE: A Placement, Routing, Back-End-of-Line Measurement UtilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2017.275007237:7(1459-1472)Online publication date: Jul-2018
https://doi.org/10.1109/TCAD.2017.2750072
Chan WHo PKahng ASaxena POzdal MChu C(2017)Routability Optimization for Industrial Designs at Sub-14nm Process Nodes Using Machine LearningProceedings of the 2017 ACM on International Symposium on Physical Design10.1145/3036669.3036681(15-21)Online publication date: 19-Mar-2017
https://dl.acm.org/doi/10.1145/3036669.3036681
Krishna RKumar PSudharsan R(2017)Optimization of wire-length and block rearrangements for a modern IC placement using evolutionary techniques2017 IEEE International Conference on Intelligent Techniques in Control, Optimization and Signal Processing (INCOS)10.1109/ITCOSP.2017.8303081(1-4)Online publication date: Mar-2017
https://doi.org/10.1109/ITCOSP.2017.8303081
Chow WYoung E(2016)Placement: From Wirelength to Detailed RoutabilityIPSJ Transactions on System LSI Design Methodology10.2197/ipsjtsldm.9.29(2-12)Online publication date: 2016
https://doi.org/10.2197/ipsjtsldm.9.2
Kahng AReda S(2016)Digital Layout: PlacementElectronic Design Automation for IC Implementation, Circuit Design, and Process Technology10.1201/b19714-7(109-132)Online publication date: 14-Apr-2016
https://doi.org/10.1201/b19714-7
Chan WDu YKahng ANath SSamadi K(2016)BEOL stack-aware routability prediction from placement using data mining techniques2016 IEEE 34th International Conference on Computer Design (ICCD)10.1109/ICCD.2016.7753259(41-48)Online publication date: Oct-2016
https://doi.org/10.1109/ICCD.2016.7753259
Markov IHu JKim M(2015)Progress and Challenges in VLSI Placement ResearchProceedings of the IEEE10.1109/JPROC.2015.2478963103:11(1985-2003)Online publication date: Nov-2015
https://doi.org/10.1109/JPROC.2015.2478963
Zhao YZhao YQian X(2014)Fast and Effective Congestion Refinement TechniqueApplied Mechanics and Materials10.4028/www.scientific.net/AMM.530-531.936530-531(936-942)Online publication date: Feb-2014
https://doi.org/10.4028/www.scientific.net/AMM.530-531.936
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.

Media

Figures

Other

Tables

View Table of Contents