Skip to main content
SpringerLink
Log in

A decomposition algorithm for circuit routing

  • Chapter
  • First Online:
Mathematical Programming Essays in Honor of George B. Dantzig Part I

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 24))

Abstract

The circuit routing problem on a VLSI chip is an extremely large linear program with a very large number of rows and columns, too large to be solved even with the column-generating techniques. Based on the distribution of nets, we recursively cut the area of the chip into smaller and smaller regions until the routing problem within a region can be handled by the Dantzig-Wolfe decomposition method. Then we successively paste the adjacent regions together to obtain the routing of the whole chip.

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. M. Breuer, “Min-cut placement”, Journal of Design Automation and Fault Tolerant Computing 1 (1976) 343–362.

    Google Scholar 

  2. K.A. Chen, M. Feuer, K.H. Khokhani, N. Nan and S. Schmidt, “The chip layout problem: an automatic wiring procedure”, Proceedings of 14th Design Automation Conference (1977) 298–302.

    Google Scholar 

  3. H. Crowder, E.L. Johnson and M.W. Padberg, “Solving large-scale zero-one linear programming problems”, Journal of ORSa 31(5) (1983) 803–834.

    MATH  Google Scholar 

  4. G.B. Dantzig, “Maximization of a linear function of variables subject to linear inequalities”, in: T.C. Koopman, ed., Activity analysis of production and allocation (John Wiley & Sons, 1951) pp. 339–347.

    Google Scholar 

  5. G.B. Dantzig, Linear programming and its extensions (Princeton University Press, Princeton, NJ, 1963).

    Google Scholar 

  6. G.B. Dantzig and R.M. Van Slyke, “Generalized upper bounded techniques for linear programming”, Journal of Computer and System Science 1 (1967) 213–226.

    MATH  Google Scholar 

  7. G.B. Dantzig and P. Wolfe, “The decomposition algorithm for linear programming”, Econometrica 29(4) (1961) 767–778.

    Article  MATH  MathSciNet  Google Scholar 

  8. L.R. Ford and D.R. Fulkerson, “Suggested computations for maximal multi-commodity network flows”, Management Science 5(1) (1958) 97–101.

    Article  MATH  MathSciNet  Google Scholar 

  9. M.R. Garey and D.S. Johnson, “The rectilinear Steiner tree problem is NP-complete”, SIAM Journal on Applied Mathematics 32 (1977) 855–859.

    Google Scholar 

  10. R.E. Gomory, “Large and non-convex problems in linear programming”, Proceedings of Symposium in Applied Mathematics 15 (1963).

    Google Scholar 

  11. R.E. Gomory and T.C. Hu, “Multi-terminal network flows”, Journal of SIAM 9 (1961) 551–570.

    MATH  MathSciNet  Google Scholar 

  12. M. Hanan, “On Steiner’s problem with rectilinear distance”, SIAM Journal on Applied Mathematics 14 (1966) 255–265.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Hanan and J.M. Kurtzberg, “A review of the placement and quadratic assignment problems”, SIAM Review 14 (1972) 324–342.

    Article  MATH  MathSciNet  Google Scholar 

  14. T.C. Hu, Integer programming and network flows (Addison-Wesley, Reading, MA, 1969).

    MATH  Google Scholar 

  15. T.C. Hu and M.T. Shing, “The α-β routing,” Technical Report CS-077, Department of Electrical Engineering and Computer Sciences, University of California, San Diego (La Jolla, CA, 1983).

    Google Scholar 

  16. F. Hwang, “On Steiner minimal trees with rectilinear distance,“ SIAM Journal on Applied Mathematics 30 (1) (1976) 104–114.

    Article  MATH  MathSciNet  Google Scholar 

  17. R.M. Karp, “Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane”, Mathematics of Operations Research 2 (3) (1977) 209–244.

    Article  MATH  MathSciNet  Google Scholar 

  18. D.E. Knuth, The art of computer programming, Vol. 1–3 (Addison-Wesley, Reading, MA, 1969, 1969, 1973).

    Google Scholar 

  19. E.S. Kuh, ed., “Special issue on routing in microelectronics”, IEEE Transactions on CAD CAD-2 (4) (1983).

    Google Scholar 

    Google Scholar 

  20. C.Y. Lee, “An algorithm for path connections and its applications”, IRE Transactions on Electronic Computers EC-10 (1961) 346–365.

    Article  Google Scholar 

  21. C. Mead and L. Conway, Introduction to VLSI systems (Addison-Wesley, Reading, MA, 1980).

    Google Scholar 

  22. E.F. Moore, “The shortest path through a maze”, Bell Telephone Laboratories Report, Monograph 3523 (Murray Hill, NJ, 1959).

    Google Scholar 

  23. J. Soukup and J.C. Royle, “On hierarchical routing”, Journal of Digital Systems 5 (3) (1981).

    Google Scholar 

    Google Scholar 

  24. R. Nair, S.J. Hong, S. Liles, and R. Villani, “Global wiring on a wire routing machine”, Proceedings 19th Design Automation Conference (1982).

    Google Scholar 

  25. J.D. Ullman, Computational aspects of VLSI (Computer Science Press, Rockville, MD, 1984).

    MATH  Google Scholar 

  26. H. Widjaja, “An effective structured approach to finding optimum partitions of networks”, Computing 29 (1982) 241–262.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of EECS, UCSD, 92093, La Jolla, CA, USA

    T. C. Hu

  2. Department of CS, UCSB, 93106, Santa Barbara, CA, USA

    M. T. Shing

Authors
  1. T. C. Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. T. Shing
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

R. W. Cottle

Additional information

Dedicated to Professor George B. Dantzig on the occasion of his seventieth birthday.

Rights and permissions

Reprints and permissions

Copyright information

© 1985 The Mathematical Programming Society, Inc.

About this chapter

Cite this chapter

Hu, T.C., Shing, M.T. (1985). A decomposition algorithm for circuit routing. In: Cottle, R.W. (eds) Mathematical Programming Essays in Honor of George B. Dantzig Part I. Mathematical Programming Studies, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121044

Download citation

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

  • Received:

  • Revised:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00918-1

  • Online ISBN: 978-3-642-00919-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation