Skip to main content

Towards a Theory of VLSI Layout

A Selected Annotated Bibliography

  • Chapter
Algorithm Design for Computer System Design

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 284))

  • 240 Accesses

Abstract

As the complexity of digital systems grew, the need arose for efficient packaging of the system components. Starting in the mid 50’s, individual devices were placed on printed-circuit boards. As the size and the complexity of the modules grew — from individual devices to integrated circuits — the princed-circuit board has preserved to this day its function as a fundamental packaging level in the assembly of digital systems. However, a new layout horizon emerged, represented by the internal structure of the modules themselves (chip complexity). Today, the latter is the predominant problem in system layout: however, in spite of largely different feature sizes, the two environments — VLSI chip and printed-circuit board — are both governed by analogous sets of rules for the layout of wires on a regular grid. The highly structured layout medium and the necessity to cope with problems of increasing size motivated the development of automatic techniques and stimulated the attending research.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.J. Lipton and R.E. Tarjan, “A separator theorem for planar graphs”, SIAM J. on Appl. Math., vol. 36, n. 2, pp. 177–189; April 1979.

    Article  MATH  MathSciNet  Google Scholar 

  2. C.E. Leiserson, “Area-efficient graph layouts (for VLSI)”, Proc. 2lst IEEE Symp. on Fondations of Computer Science, Syracuse, NY, October 1980; pp. 270–281.

    Google Scholar 

  3. L.G. Valiant, “Universality considerations in VLSI circuits”, IEEE Trans. on Computers, vol. C-30, n. 2, pp. 135–140; February 1981.

    Article  MathSciNet  Google Scholar 

  4. F.T. Leighton, “New lower bound techniques for VLSI”, Proc. 22nd IEEE Symp. on Foundations of Computer Science, Nashville, Tenn., October 1981; pp. 1–12.

    Google Scholar 

  5. F.T. Leighton, “A layout strategy which is provably good”, Proc.l4th ACM Symp. on Theory of Computing, San Francisco, CA, May 1982; pp. 85–98.

    Google Scholar 

  6. J.R. Gilbert, “Graph separator theorems and sparse Gaussian Elimination”, Rep. N. STAN-CS-80–833, dept. of Comp. Sci., Stanford University; December 1980.

    Google Scholar 

  7. S.N. Bhatt and F.T. Leighton, “A framework for solving VLSI graph layout problems”, Journal of Computer and System Sciences, to appear.

    Google Scholar 

  8. C.Y. Lee, “An algorithm for path connections and its applications”, IRE Trans. on Computers, vol. EC-10, pp. 346–365; September 1961.

    Google Scholar 

  9. D.W. Hightower, “A solution to line routing problems on the continuous plane”, Proc. 6th Design Automation Workshop, pp. 1–24, June 1969.

    Google Scholar 

  10. G.V. Dunn, “The design of printed circuit layouts by computer”, Proc. 3rd Australian Computer Conf. pp. 419–423, (1967).

    Google Scholar 

  11. S.E. Lass, “Automated printed circuit routing with a stepping aperture”, Comm. of the ACM, 12 n. 5, pp. 262–265, (1969).

    Article  Google Scholar 

  12. A. Hashimoto and J. Stevens, “Wire routing by optimizing channel assignment within large apertures”, Proc. 8th Design Automation Workshop, pp. 155–169, Jane 1971.

    Google Scholar 

  13. B.W. Kernighan, D.G. Schweikert, G. Persky, “An optimum channel routing algorithm for polycell layouts of integrated circuits”, Proc. 10th Design Automation Workshop, pp. 50–59, June 1973.

    Google Scholar 

  14. A. Deutsch, “A dogleg channel router”, Proc. 13th Design Autmation Conference, pp. 425–433, 1976.

    Google Scholar 

  15. R.L. Rivest, A. Baratz, and G. Miller, “Provably good channel routing algorithms”, Proc. 1981 Carnegie-Mellon Conf. on VLSI, pp. 153–159, October 1981.

    Google Scholar 

  16. F.T. Leighton, “New lower bounds for channel routing”, draft 1981.

    Google Scholar 

  17. F.P. Preparata and W. Lipski, Jr., “Three layers are enough”, Proc. 23rd IEEE Symp. on Foundations of Computer Science, Chicago, IL, pp. 350–357, November 1982 (see also: Preparata-Lipski, “Optimal three-layer channel routines”, IEEE Trans. on Computers, May 1984 (to appear))

    Google Scholar 

  18. T.G. Szymanski, “Dogleg channel routing is NP-complete”, to appear (1982).

    Google Scholar 

  19. D.J. Brown, F.P. Preparata, “Three-layer routing of multiterminal nets”, unpublished manuscript, October 1982

    Google Scholar 

  20. M. Sarrafzadeh and F.P. Preparata, “Compact channel routing of multi-terminal nets”, Tech. Rep. ACT. 44, Coordinated Science Lab., University of Illinois, October 1983.

    Google Scholar 

  21. R.L. Rivest, C.M. Fiduccia, “A greedy channel router”, Proc. 19 Design Automation Conference, pp. 418–424, June 1982.

    Google Scholar 

  22. R.L. Rivest, “The ‘PI’ (Placement and Interconnect) System”, Proc. 19th Design Automation Conference, pp. 475–481, June 1982.

    Google Scholar 

  23. W. Lipski,Jr., “The structure of three-laÿer wireable layouts”, to appear in Advances in Computing Research, Volume 2, VLSI Theory, (1984)

    Google Scholar 

  24. M. Brady and D.J. Brown, “VLSI routing: four layers suffice”, in Advances in Computing Research Volume 2: VLSI Theory, (1984).

    Google Scholar 

  25. A.S. LaPaugh, “A polynomial time algorithm for optimal routing around a rectangle”, Proc. 21st Symp. on Foundations of Computer Science (Syracuse), pp. 282–293, October 1980.

    Google Scholar 

  26. T.F. Gonzales and S.L. Lee, “An optimal algorithm for optimal routing around a rectangle”, Proc. 20th Allerton Conference on Communication Control, and Computing, pp. 636–645, October 1982

    Google Scholar 

  27. A. Frank, “Disjoint paths in a rectilinear grid“, Combinatorica, 2, 4, pp. 361–371, (1982)

    Article  MATH  MathSciNet  Google Scholar 

  28. K. Mehlhorn and F.P. Preparata, “Routing through a rectangle”, Tech. Rep. ACT-42, Coordinated Science Lab., Univ. of Illinois, Urbana: October 1983; submitted for publication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Wien

About this chapter

Cite this chapter

Preparata, F.P. (1984). Towards a Theory of VLSI Layout. In: Ausiello, G., Lucertini, M., Serafini, P. (eds) Algorithm Design for Computer System Design. International Centre for Mechanical Sciences, vol 284. Springer, Vienna. https://doi.org/10.1007/978-3-7091-4338-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-4338-4_9

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81816-9

  • Online ISBN: 978-3-7091-4338-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics