Skip to main content
Log in

New algorithms for minimizing the longest wire length during circuit compaction

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Consider the problem of performing one-dimensional circuit compaction for a layout containingn h horizontal wires andn layout cells. We present new and efficient constrain-graph-based algorithms for generating a compacted layout in which either the length of the longest wires or a user-specified tradeoff function between the layout width and the longest wire length is minimized. Both algorithms have anO(n h ·nlogn) running time. The concept employed by our algorithms is that of assigning speeds to the layout cells. Speeds are computed by performing path computations in subgraphs of the constraint graphs. A compacted layout is generated over a number of iterations, with each iteration first determining speeds and then moving the layout elements to the right according to the computed speeds. Each iteration produces a better layout and after at mostn·n h iterations the final layout is produced.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Rent this article via DeepDyve

Similar content being viewed by others

References

  1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest,Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.

    MATH  Google Scholar 

  2. S. Gao, M. Kaufmann, and F. M. Maley. Advances in homotopic layout compaction.Proceedings of the 1989ACM Symposium on Parallel Algorithms and Architectures, pages 273–282, 1989.

  3. S. E. Hambrusch and H. Y. Tu, Minimizing total wire length during 1-dimensional compaction.INTEGRATION, the VLSI Journal, 14(2):113–144, 1992.

    Article  MATH  Google Scholar 

  4. J. F. Lee and C. K. Wong. A performance-aimed cell compactor with automatic jogs.IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 11(12):1495–1507, December 1992.

    Article  Google Scholar 

  5. T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout. Wiley, New York, 1990.

    MATH  Google Scholar 

  6. Y. Z. Liao and C. K. Wong. An algorithm to compact a VLSI symbolic layout with mixed constraints.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2(2):62–69, April 1983.

    Article  Google Scholar 

  7. D. Marple. A hierarchy preserving hierarchical compactor.Proceedings of the 27th ACM/IEEE Design Automation Conference, pages 375–381, 1990.

  8. N. Megiddo. Linear-time algorithms for linear programming inR 3 and related problems.SIAM Journal on Computing, 12(4):759–775, November 1983.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. A. Mlynski and C. H. Sung. Layout compaction. In T. Ohtsuki, editor,Layout Design and Verification, pages 199–235, Elsevier, Amsterdam, 1986.

    Google Scholar 

  10. A. R. Newton. Symbolic layout and procedural design. In G. DeMicheli, A. Sangiovanni-Vincentelli, and P. Antognetti, editors,Design Systems for VLSI Circuits, pages 65–112. Martinus Nijhoff, Boston, MA, 1987.

    Google Scholar 

  11. A. Onozawa. Layout compaction with attractive and repulsive constraints.Proceedings of the 27th ACM/IEEE Design Automation Conference, pages 369–374, 1990.

  12. F. P. Preparata and M. I. Shamos,Computational Geometry. Springer-Verlag, New York, 1985.

    MATH  Google Scholar 

  13. W. L. Schiele. Improved compaction by minimized length of wires.Proceedings of the 20th ACM/IEEE Design Automation Conference, pages 121–121, 1983.

  14. M. Schlag, F. Luccio, P. Maestrini, D. T. Lee, and C. K. Wong. A visibility problem in VLSI layout compaction. In F. P. Preparata, editor,Advances in Computing Research: VLSI Theory, pages 259–282. JAI Press, Greenwich, CT, 1984.

    Google Scholar 

  15. B. X. Weis and D. A. Mlynski. A graph-theoretic approach to the relative placement problem.IEEE Transactions on Circuits and Systems, 35(3):286–293, 1988.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by A. S. LaPaugh

This research was supported in part by DARPA under Contract DABT63-92-C-0022 The views and conclusions contained in this paper are those of the authors and should not be interpreted as representing official policies, expressed or implied, of the U.S. government.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hambrusch, S.E., Tu, HY. New algorithms for minimizing the longest wire length during circuit compaction. Algorithmica 17, 426–448 (1997). https://doi.org/10.1007/BF02523682

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key Words

Navigation