Article

Free access

Faster minimization of linear wirelength for global placement

Authors:

Charles J. Alpert,

Dennis J.-H. Huang,

Andrew B. Kahng,

Igor L. Markov,

Kenneth YanAuthors Info & Claims

ISPD '97: Proceedings of the 1997 international symposium on Physical design

April 1997

Pages 4 - 11

https://doi.org/10.1145/267665.267670

Published: 01 April 1997 Publication History

First page of PDF

References

[1]

T, F. Chan, G. H. Golub and P. Mulet, "A Nonlinear Primal-Dual Method for TV-Based Image Restoration", In Proc. of ICAOS'96, 12 th Int'l Conf. on Analysis and Optimization of Systems: Images, Wavelets and PDEs, Paris, June 26-28, 1996, M. Bergex et al (eds.), No. 219 in Lecture Notes in Control and Information Sciences, 1996, pp. 241-252.

[2]

C.K. Cheng and E. S. Ktth, "Module Placement Based on Resistive Network Optimization", IEEE Transactions on Computer-Aided Design, CAD-3, 1984, pp. 218-225.

Digital Library

[3]

A. Corm and M. Overton, "A Primal-Dual Interior Point Method for Minimizing a Sum of Euclidean Distances", Computer Science Department, New York University, Technical Report, 1995.

[4]

U. Ed~ardt, "On an Optimization Problem Related to Minimal Surfaces with Obstacles", in: R. Bulirsch, W. Oetti and J. Stoer editors; "Optimization and Optimal Control", Lecture Notes in Mathematics 477 Springer Verlag, 1975, pp. 95-101.

[5]

U.~ardt, "Weber's Problem and Weiszfeld's Algorithm in General Spaces", Mathematical Programming 18, 1980, pp. 186-196.

[6]

W. Hackbush, Iterative Solution of Large Sparse Systems, Springer Verlag, 1994.

[7]

T. Hamada, C.-K. Cheng and P. M. Chau, "Prime: A Timing-Driven Placement Tool using A Piecewise Linear Resistive Network Approach", Proc. 30th A CM/IEEE Design Automation Conference, 1993, pp. 531-536.

Digital Library

[8]

C. Kelley, "Iterative Methods for Linear and Nonlinear Equations", Frontiers in Applied ~{athematics, vol. 16, SIAM, 1995.

[9]

J. Kleinhans, G. Sigl, F. Johannes and K. Antreich, "GOR- DIAN:VLSI Placement by Quadratic Programming and Slicing Optimization." {EEE Transactions on Computer- Aided Design. 10 (3), March 1991, pp. 356-365.

Digital Library

[10]

Y. Li, "A Newton Acceleration of the Weiszfeld Algorithm for Minimizing the Sum of Euclidean Distances", Cornell University, Technical Report, 1996.

Digital Library

[11]

I.I. Mahmoud, K. Asakura, T. Nishibu and T. Ohtsuki, "Ex~perimental Appraisal of Linear and Quadratic Objective Functions Effect on Force Directed Method for Analog Placement", IEICE Transactions on Fundamentals of Electronics, Communlca~ions and Computer Sciences, E77-A (4), April 1994, pp. 719-725.

[12]

E. Miehle, "Link-Length Minimization in Networks", Operations Research, 6, 1958, pp. 232-243.

Digital Library

[13]

J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, New York, Academic Press, 1970.

Digital Library

[14]

B. M. Riess, K. Doll and F. M. Johannes, "Partitioning Very Large Circuits Using Analytical Placement Techniques", Proc. 31st ACM/IEEE Design Automation Conference, 1994, pp. 646-651.

Digital Library

[15]

B. Riess and G. Ettelt, "SPEED: Fast and Efficient Timing Driven Placement", Proc. IEEE Int. Symp. Circuits and Systems, vol. 1, 1995, pp. 377-380.

[16]

G. Sigl, K. Doll and F. Johannes, "Analytical Placement: A Linear or a Quadratic Objective Function?" Proc. 28th A CM/IEEE Design Automation Conference, 1991, pp. 427- 432.

Digital Library

[17]

W. Swartz and C. Sechen. "Timing Driven Placement for Large Standard Cell Circuits", Proc. 32nd A CM/IEEE Design Automation Conference, 1995, pp. 211-215.

Digital Library

[18]

R. S. Tsay, E. Kuh, "A Unified Approach to Partitioning and Placement", IEEE Transactions on Circuits and Systems, Vol.38, No.5, May 1991. pp. 521-633.

[19]

E. Weiszfeld, "Sur le Point pour Lequel la Somme des Distances de n Points Donn~es est Minimum." TShoku Mathernatics J. 43, 1937, pp. 355-386.

Cited By

Kahng ALienig JBehjat LYang S(2021)Advancing PlacementProceedings of the 2021 International Symposium on Physical Design10.1145/3439706.3446884(15-22)Online publication date: 22-Mar-2021
https://dl.acm.org/doi/10.1145/3439706.3446884
Farooq UMehrez H(2021)Pre-Silicon Verification Using Multi-FPGA Platforms: A ReviewJournal of Electronic Testing10.1007/s10836-021-05929-1Online publication date: 23-Feb-2021
https://doi.org/10.1007/s10836-021-05929-1
Farooq UAlzahrani B(2020)Exploring and optimizing partitioning of large designs for multi-FPGA based prototyping platformsComputing10.1007/s00607-020-00834-5Online publication date: 21-Jul-2020
https://doi.org/10.1007/s00607-020-00834-5
Show More Cited By

Index Terms

Faster minimization of linear wirelength for global placement
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
      1. Placement
      2. Wire routing
2. Mathematics of computing

Recommendations

Blockage-aware terminal propagation for placement wirelength minimization
ICCAD '17: Proceedings of the 36th International Conference on Computer-Aided Design

Wirelength is the most fundamental objective in placement because it also affects various placement metrics (routability, timing, etc.). Half-perimeter wirelength (HPWL) is a pervasive metric for circuit placement. However, preplaced blocks (i.e., ...
Read More
Wirelength minimization for min-cut placements via placement feedback

The advent of strong multilevel partitioners has made top-down min-cut placers a favored choice for modern placer implementations. Terminal propagation is an important step in min-cut placers because it translates partitioning results into global-...
Read More
Faster minimization of linear wirelength for global placement

A linear wirelength objective more effectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placement tool minimizes linear wirelength by first approximating the linear ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISPD '97: Proceedings of the 1997 international symposium on Physical design

April 1997

230 pages

ISBN:0897919270

DOI:10.1145/267665

Chairmen:
Andrew B. Kahng
Univ. of California, Los Angeles, and Cadence Design Systems, San Jose, CA
,
Majid Sarrafzadeh
Northwestern Univ., Evanston, IL

Copyright © 1997 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: 01 April 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISPD97

Sponsor:

SIGDA

ISPD97: 1997 International Symposium on Physical Design

April 14 - 16, 1997

California, Napa Valley, 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

18
Total Citations
View Citations
210
Total Downloads

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

Other Metrics

View Author Metrics

Citations

Cited By

Kahng ALienig JBehjat LYang S(2021)Advancing PlacementProceedings of the 2021 International Symposium on Physical Design10.1145/3439706.3446884(15-22)Online publication date: 22-Mar-2021
https://dl.acm.org/doi/10.1145/3439706.3446884
Farooq UMehrez H(2021)Pre-Silicon Verification Using Multi-FPGA Platforms: A ReviewJournal of Electronic Testing10.1007/s10836-021-05929-1Online publication date: 23-Feb-2021
https://doi.org/10.1007/s10836-021-05929-1
Farooq UAlzahrani B(2020)Exploring and optimizing partitioning of large designs for multi-FPGA based prototyping platformsComputing10.1007/s00607-020-00834-5Online publication date: 21-Jul-2020
https://doi.org/10.1007/s00607-020-00834-5
Pangracious VMarrakchi ZMehrez HPangracious VMarrakchi ZMehrez H(2015)Two Dimensional FPGAs: Configuration and CAD FlowThree-Dimensional Design Methodologies for Tree-based FPGA Architecture10.1007/978-3-319-19174-4_4(73-94)Online publication date: 26-Jun-2015
https://doi.org/10.1007/978-3-319-19174-4_4
Honda TKohira Y(2014)An Acceleration for Any-Angle Routing Using Quasi-Newton Method on GPGPUProceedings of the 2014 IEEE 8th International Symposium on Embedded Multicore/Manycore SoCs10.1109/MCSoC.2014.46(281-288)Online publication date: 23-Sep-2014
https://dl.acm.org/doi/10.1109/MCSoC.2014.46
Kohira YTakahashi A(2012)An any-angle routing method using quasi-Newton method17th Asia and South Pacific Design Automation Conference10.1109/ASPDAC.2012.6164935(145-150)Online publication date: Jan-2012
https://doi.org/10.1109/ASPDAC.2012.6164935
Fernau H(2008)Parameterized algorithmics for linear arrangement problemsDiscrete Applied Mathematics10.1016/j.dam.2008.05.008156:17(3166-3177)Online publication date: 1-Oct-2008
https://dl.acm.org/doi/10.1016/j.dam.2008.05.008
Chong PSzegedy CMadden PPan D(2007)A morphing approach to address placement stabilityProceedings of the 2007 international symposium on Physical design10.1145/1231996.1232018(95-102)Online publication date: 18-Mar-2007
https://dl.acm.org/doi/10.1145/1231996.1232018
Kahng ALach JMangione-Smith WMantik SMarkov IPotkonjak MTucker PWang HWolfe G(2006)Constraint-based watermarking techniques for design IP protectionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.95274020:10(1236-1252)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.952740
Yonghong Xu Khalid M(2005)QPF: efficient quadratic placement for FPGAsInternational Conference on Field Programmable Logic and Applications, 2005.10.1109/FPL.2005.1515784(555-558)Online publication date: 2005
https://doi.org/10.1109/FPL.2005.1515784
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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

Media

Figures

Other

Tables

View Table of Contents