Article

Free access

Efficient final placement based on nets-as-points

Authors:

R. A. RohrerAuthors Info & Claims

DAC '89: Proceedings of the 26th ACM/IEEE Design Automation Conference

Pages 578 - 581

https://doi.org/10.1145/74382.74479

Published: 01 June 1989 Publication History

Abstract

Deterministic optimization programs are coming to be considered as viable alternatives for the placement of very large sea-of-gate, gate array and standard cell designs. A nets-as-points placement program has been described which provides competitive results in comparison with non-deterministic placement, and at a fraction of the run time. A new pseudo Steiner tree model for the gate placement about the netpoints, along with a virtual channel snap-to-grid procedure, provides results superior to the original nets-as-points placement program without requiring iterative improvement.

References

[1]

S. Kirkpatrick, C.D. Gelatt, Jr., and M.P. Vecchi. Optimization by simulated annealing. Science, 220:45-54, 1983.

[2]

K.M. Hall. An r-dimensional quadratic placement algorithm. Management Science, 17(3):219-229, 1970.

Digital Library

[3]

C. Cheat and E.S. Kuh. Module placement based on resistive network optimization. IEEE Trans. on Computer.Aided Design of Integrated Circuits and Systems, CAD-3:218-225, 1984.

[4]

j.P. Blanks. Near-optimal placement using a quadratic objective function. In Proceedings o} the 2Znd Design A u~omatiort Conference, June 1985.

Digital Library

[5]

j. Frankle and R.M. Kaxp. Circuit placements and cost bounds by eigenvector decomposition. In Proceedings o} ~he IEEE International ConJerence on Computer-Aided Design, November } 986.

[6]

K.M. Just, j.M. Kleinhans, and F.M. Johannes. On the relative placement and the transportation problem for standardcell layout. In Proceedings o} the ~Jnd Design Automation Conference, June 1986.

Digital Library

[7]

C. Sechen and A. Sangiovarmi-Vincentelli. TimberwolfJ.2:a new standard cell placement and global routing package. Proceeding o}~he 23th Design Automation Conference, pages 432-439, June 1986.

Digital Library

[8]

R-S Tsay, E. S. Kuh, and C-P Hsu. A fast sea-of-gates placement algorithm. Proceedings o} the ~5th Design A utomation Conference, pages 318-323, June 1988.

Digital Library

[9]

D.G. Schwelkert and B.W. Kernighan. A proper model for the partitioning of electrical circuits. In Proceedings o} the 9~h Design Automation Workslro~), pages 57'-62, 1972.

Digital Library

[10]

L. Pillage and 1~. A. Rohrer. A quadratic metric with a simple solution scheme for initial placement. Proceedings o} the 25th Design Automation Conference, pages 324-329, June 1988.

Digital Library

[11]

M.A. Breuer. A class of rain-cut placement algorithms. In Proceedings of the l~h Design Automation Conference, pages 343-362, 1977.

Digital Library

[12]

C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions, tn Proceedings o} the 19th Design A utomalion Conference, pages 175-181, 1982.

Digital Library

[13]

N. Hanna. On steiner's problem with rectilinear distance. SIAM J. of Applied Math., 14:255-265, March 1966.

[14]

A,E. Dunlop and B,W. Kernighan. A placement procedure for layout of vlsi circuits. IEEE Trans. CAD of ICs and Systems, 4(1):92-98, 1985.

Digital Library

[15]

international Workshop on Placement and Routing, Research Triangle Park, North Carolina, May 10-13, 1988.

Cited By

Yamin Du Vannelli A(1998)A nonlinear programming and local improvement method for standard cell placementProceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143)10.1109/CICC.1998.695048(597-600)Online publication date: 1998
https://doi.org/10.1109/CICC.1998.695048
Du YVannelli A(1998)A nonlinear programming placement approach based on target distance model and iterative construction methodConference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)10.1109/CCECE.1998.682781(449-452)Online publication date: 1998
https://doi.org/10.1109/CCECE.1998.682781
Meyer S(1991)Using controlled experiments in layoutACM SIGDA Newsletter10.1145/126990.12699121:1(46-55)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/126990.126991

Index Terms

Efficient final placement based on nets-as-points
1. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
  2. Very large scale integration design
    1. Application-specific VLSI designs

Recommendations

An efficient and effective detailed placement algorithm
ICCAD '05: Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design

In the past few years, there has been a lot of research in the area of global placement. In comparison, not much attention has been paid to the detailed placement problem. Existing detailed placers either fail to improve upon the excellent solution ...
Efficient and effective placement for very large circuits

We present a new approach to simulated annealing and a new hierarchical algorithm for row-based placement which has obtained the best results ever reported for a large set of MCNC benchmark circuits. Our results indicate that chip area reductions up to ...
Routability-Driven Blockage-Aware Macro Placement
DAC '14: Proceedings of the 51st Annual Design Automation Conference

We present a new floorplan representation, called circular-packing trees (CP-trees), for the problem of macro placement. Our CP-trees can flexibly pack movable macros toward corners or pre-placed macros along chip boundaries circularly to optimize macro ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DAC '89: Proceedings of the 26th ACM/IEEE Design Automation Conference

June 1989

839 pages

ISBN:0897913108

DOI:10.1145/74382

Chairman:
Donald E. Thomas
Carnegie Mellon Univ., Pittsburgh, PA

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

IEEE-CS\TCDA: TC Design Automation
SIGDA: ACM Special Interest Group on Design Automation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC89

Sponsor:

IEEE-CS\TCDA
SIGDA

DAC89: The 26th ACM/IEEE-CS Design Automation Conference

June 25 - 28, 1989

Nevada, Las Vegas, USA

Acceptance Rates

DAC '89 Paper Acceptance Rate 156 of 465 submissions, 34%;

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

3
Total Citations
View Citations
154
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)3

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yamin Du Vannelli A(1998)A nonlinear programming and local improvement method for standard cell placementProceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143)10.1109/CICC.1998.695048(597-600)Online publication date: 1998
https://doi.org/10.1109/CICC.1998.695048
Du YVannelli A(1998)A nonlinear programming placement approach based on target distance model and iterative construction methodConference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)10.1109/CCECE.1998.682781(449-452)Online publication date: 1998
https://doi.org/10.1109/CCECE.1998.682781
Meyer S(1991)Using controlled experiments in layoutACM SIGDA Newsletter10.1145/126990.12699121:1(46-55)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/126990.126991

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