Skip to main content
SpringerLink
Log in

Input sensitive VLSI layouts for graphs of arbitrary degree

  • VLSI Layout
  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 319))

Included in the following conference series:

Abstract

A general method to find area-efficient VLSI layouts of graphs of arbitrary degree is presented. For graphs of maximum degree Δ, the layouts obtained are smaller by a factor of Δ2 than those obtained using existing methods.

Optimal planar layouts, and near-optimal nonplanar layouts are also derived for planar graphs of arbitrary degree and gauge. The results span the spectrum between outerplanar graphs (gauge 1), and arbitrary planar graphs (gauge O(n)). Optimality is established by developing families of planar graphs of varying gauge and degree, and proving lower bounds on their layout area. These techniques can be combined to exhibit a trade-off between area and the number of contact cuts. The resulting scheme is sensitive to all three parameters that affect the area: the maximum degree, the gauge, and the number of contact cuts.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggarwal, M. M. Klawe, D. Lichtenstein, N. Linial, and A. Wigderson. Multi-layer grid embeddings. Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, 186–196, 1985.

    Google Scholar 

  2. B. S. Baker. Approximation algorithms for np-complete problems on planar graphs. Proc. 24th Annual IEEE Symposium on Foundations of Computer Science, 265–273, 1983.

    Google Scholar 

  3. S. N. Bhatt and F. T. Leighton. A framework for solving vlsi graph layout problems. Journal of Computer and System Sciences, 28:300–343, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. N. Djidjev. On the problem of partitioning planar graphs. SIAM Journal on Algebraic and Discrete Methods, 3(2):229–240, June 1982.

    MATH  MathSciNet  Google Scholar 

  5. D. Dolev, F. T. Leighton, and H. W. Trickey. Planar embedding of planar graphs. In Advances in Computing Research, vol. 2, pages 147–161, JAI Press, 1984.

    Google Scholar 

  6. J. R. Gilbert, D. J. Rose, and A. Edenbrandt. A separator theorem for chordal graphs. SIAM Journal on Algebraic and Discrete Methods, 5(3):306–313, 1984.

    MATH  MathSciNet  Google Scholar 

  7. F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.

    Google Scholar 

  8. D. B. Johnson and S. M. Venkatesan. Parallel algorithms for minimum cuts and maximum flows in planar networks. Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science, 244–254, 1982.

    Google Scholar 

  9. F. T. Leighton. New lower bound techniques for vlsi. Proc. 22nd Annual Symposium on Foundations of Computer Science, 1–12, 1981.

    Google Scholar 

  10. C. E. Leiserson. Area Efficient VLSI Computation. PhD thesis, Carnegie Mellon University, 1981.

    Google Scholar 

  11. C. E. Leiserson. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C-34(10):892–901, Oct 1985.

    Google Scholar 

  12. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2):177–189, April 1979.

    Article  MATH  MathSciNet  Google Scholar 

  13. Gary Miller. Finding small simple cycle separators for 2-connected graphs. Proc. 16th Annual ACM Symposium on Theory of Computing, 376–382, 1984.

    Google Scholar 

  14. D. D. Sherlekar. Graph Dissection Techniques for VLSI and Algorithms. PhD thesis, University of Maryland, College Park, Maryland, 1987.

    Google Scholar 

  15. D. D. Sherlekar and J. Ja'Ja'. Layouts of graphs of arbitrary degree. Proceedings of the 25th Annual Allerton Conference, September 1987.

    Google Scholar 

  16. Y. Shiloach. Linear and Planar Arrangement of Graphs. PhD thesis, Weizmann Institute, Rehovot, Israel, 1976.

    Google Scholar 

  17. C. D. Thompson. A Complexity Theory for VLSI. PhD thesis, Carnegie Mellon University, 1980.

    Google Scholar 

  18. J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984.

    Google Scholar 

  19. L. G. Valiant. Universality considerations in vlsi circuits. IEEE Transactions on Computers, C-30(2):135–140, Feb 1981.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Michigan, USA

    Deepak D. Sherlekar

  2. University of Maryland, USA

    Joseph JáJá

Authors
  1. Deepak D. Sherlekar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph JáJá
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sherlekar, D.D., JáJá, J. (1988). Input sensitive VLSI layouts for graphs of arbitrary degree. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040394

Download citation

  • DOI: https://doi.org/10.1007/BFb0040394

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation