Algorithmica

, Volume 3, Issue 1–4, pp 487–510 | Cite as

Optimal VLSI graph embeddings in variable aspect ratio rectangles

  • Paul Czerwinski
  • Vijaya Ramachandran
Article

Abstract

We generalize earlier results in VLSI layout theory by considering variable aspect ratio embeddings for VLSI graphs. By aspect ratio we mean the ratio of the length of the longer side to the length of the shorter side of the bounding rectangle of the embedding. Our results are based on separators and bifurcators. We obtain embeddings with existentially optimal area and any desired aspect ratio. Additionally, we can obtain either bounded capacitive delay or existentially optimal minimax edge length in the embeddings; both of these features reduce delays in the circuit.

A special feature of our results on minimax edge length is that they unify earlier separator- and bifurcator-based results for square embeddings, and also provide a simplified lower bound proof.

Key words

VLSI layout Graph embedding Variable aspect ratio rectangles 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BhLeig84]
    S. N. Bhatt and F. T. Leighton, A framework for solving VLSI graph layout problems,J. Comput. System Sci.,28(2) (1984), 300–343.MATHCrossRefMathSciNetGoogle Scholar
  2. [BiPraPre81]
    G. Bilardi, M. Pracchi, and F. Preparata, A critique and appraisal of VLSI models of computation,Proceedings of the CMU Conference on VLSI Systems and Computation (1981), pp. 81–88.Google Scholar
  3. [BrKu80]
    R. P. Brent and H. T. Kung, On the area of binary tree layouts,Inform. Process. Lett. (1980), 46–48.Google Scholar
  4. [Cz85]
    P. Czerwinski, Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles, Master's thesis, Department of Electrical and Computer Engineering, University of Illinois, Urbana (1985).Google Scholar
  5. [Leig81]
    F. T. Leighton, New lower bound techniques for VLSI,Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (1981), pp. 1–12.Google Scholar
  6. [Leis80]
    C. E. Leiserson, Area-efficient graph layouts (for VLSI),Proceedings of the 21st Annual Symposium on Foundations of Computer Science (1980), pp. 270–281.Google Scholar
  7. [MeCo80]
    C. A. Mead and L. Conway,Introduction to VLSI Systems, Addison-Wesley, Reading, MA, 1980.Google Scholar
  8. [PaRuSn81]
    M. S. Paterson, W. L. Ruzzo, and L. Snyder, Bounds on minimax edge length for complete binary trees,Proceedings of the 13th Annual ACM Symposium on Theory of Computing (1981), pp. 293–299.Google Scholar
  9. [Pi73]
    M. S. Pinsker, On the complexity of a concentrator,Proceedings of the 7th International Teletraffic Congress, 1973, pp. 318/1–318/4.Google Scholar
  10. [Ra82a]
    V. Ramachandran, Area-optimal graph embeddings for VLSI in rectangles of varying aspect ratio, Technical Report #301, EECS Department, Princeton University (1982).Google Scholar
  11. [Ra82b]
    V. Ramachandran, On driving many long wires in a VLSI layout,Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (1982), pp. 369–378; alsoJ. Assoc. Comput. Mach.,33(4) (1986), 687–701.Google Scholar
  12. [Th80]
    C. D. Thompson, A Complexity Theory for VLSI, Ph.D. thesis, Carnegie-Mellon University (1980).Google Scholar
  13. [Va81]
    L. G. Valiant, Universality considerations in VLSI circuits,IEEE Trans. Comput.,30(2) (1981), 135–140.MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Paul Czerwinski
    • 1
  • Vijaya Ramachandran
    • 1
  1. 1.Coordinated Science LaboratoryUniversity of IllinoisUrbanaUSA

Personalised recommendations