Skip to main content

Average Interconnection Length Estimation

  • Chapter
  • 102 Accesses

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 54))

Abstract

This chapter presents models and algorithms for accurately estimating the total interconnect length for both random and optimized placements. The algorithms developed in the next chapter for accurately estimating interconnect area require a good estimate of the final total interconnect length. The final total interconnect length is determined by the macro/custom cell placement algorithm which was presented in the previous chapter. This placement algorithm was based on the simulated annealing algorithm. A characteristic feature of simulated annealing is long computation times. Hence the possibility of executing the placement algorithm twice, once for ascertaining the final total interconnect length and the second for obtaining the final placement using the interconnect-area estimator, is unreasonable.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Goto and E. Kuh, “An Approach to the Two-Dimensional Placement Problem in Circuit Layout,” (1978).

    Google Scholar 

  2. E. N. Gilbert, “Random Minimal Trees,” (1965).

    Google Scholar 

  3. W. E. Donath, “Statistical Properties of the Placement of a Graph.” (1968).

    Google Scholar 

  4. I. Sutherland and D. Oestreicher, “How Big Should a Printed Circuit Board Be?,” (1973).

    Google Scholar 

  5. W. E. Donath, “Placement and Average Interconnect Lengths of Computer Logic,” (1979).

    Google Scholar 

  6. B. Landman and R. Russo, “On a Pin Versus Block Relationship for Partitions of Logic Graphs,” (1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Kluwer Academic Publishers, Boston

About this chapter

Cite this chapter

Sechen, C. (1988). Average Interconnection Length Estimation. In: VLSI Placement and Global Routing Using Simulated Annealing. The Kluwer International Series in Engineering and Computer Science, vol 54. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1697-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1697-8_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8957-9

  • Online ISBN: 978-1-4613-1697-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics