[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/949970.950041acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
Article
Free access

An efficient placement method for large standard-cell and sea-of-gates designs

Published: 12 March 1990 Publication History

Abstract

A fast placement algorithm is presented for large Standard-Cell and Sea-of-Gates placement problems. The time complexity of the algorithm is O (n log2n). In comparison with a state of the art conventional placement and routing tool it yields more than 10 % smaller layouts with significantly better timing characteristics. The method underlying this algorithm uses a quadratic cost function of the wire length and has a wider applicability than existing methods. We expect that with this algorithm high quality placements upto 100000 cells can be obtained.

References

[1]
S. Kirkpatrick, C. D. Gelatt Jr. and M. P. Vecchi, "Optimization by Simulated Annealing", Science Vol. 220 (1983) 671.
[2]
C-K. Cheng and E. S. Kuh, "Module Placement Based on Resistive Network Optimization", IEEE Trans. Computer-Aided Design, Vol. CAD-3, No. 3, (1984) 218--225.
[3]
R-S. Tsay and E. Kuh, "A Unified Approach to Circuit Partitioning and Placement", Proc. Princeton Conf. Information Sciences and Systems, (1986) 155--160.
[4]
H. J. Kappen. "An efficient heuristic for Standard-Cell Placement" submitted to Integration.
[5]
M. R. Garey and D. S. Johnson, "Computers and Intractability. A guide to the Theory of NP-Completeness". W. H. Freeman and Company, New York 1979.
[6]
R. S. Tsay, E. S. Kuh and C. P Hsu, "Proud: a Sea-of-Gates placement algorithm", IEEE Design & Test of Computers, (1988)44.
[7]
Nag Fortran Library, The Numerical Algorithms Group Ltd, Oxford, UK.
[8]
A. E. Dunlop and B. W. Kernighan, "A procedure for placement of Standard-Cell VLSI circuits", IEEE Transactions on Computer-Aided Design, Vol. CAD-4, No. 1, (1985).
[9]
LASO2, A set of Fortran IV subroutines for computing a few eigenvalues and eignvectors of a large (sparse) symmetric matrix. Author D. S. Scott. Source available by sending message 'send index' to anl-mcs. ARPA!netlibd.
[10]
P. de Wilde (ed.), "The Integrated Design Book", Delft University Press (1986) 7.55--7.147. J. A. G. Jess et. al., "A Gate-Array Design System adapted to many technologies", Proc. ICCAD, (1984) 338--343.
  1. An efficient placement method for large standard-cell and sea-of-gates designs

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    EURO-DAC '90: Proceedings of the conference on European design automation
    March 1990
    659 pages
    ISBN:0818620242
    • General Chair:
    • Gordon Adshead,
    • Program Chair:
    • Jochen Jess

    Sponsors

    Publisher

    IEEE Computer Society Press

    Washington, DC, United States

    Publication History

    Published: 12 March 1990

    Check for updates

    Author Tags

    1. Quadratic Assignment Problem
    2. Standard Cell placement
    3. optimization
    4. recursive partitioning

    Qualifiers

    • Article

    Upcoming Conference

    DAC '25
    62nd ACM/IEEE Design Automation Conference
    June 22 - 26, 2025
    San Francisco , CA , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 113
      Total Downloads
    • Downloads (Last 12 months)19
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 09 Dec 2024

    Other Metrics

    Citations

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media