A global router with a theoretical bound on the optimal solution

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 15, Issue 2, 1996, Pages 208216-

  Garden, Robert C ^a,b,c   Li, Jianmin ^a,b,c   Cheng, Chung Kuan ^a,b,c  

^a IEEE   (United States)

^b Unisys   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33747652978     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. B. S. Ting and B. N. Tien, Routing techniques for gate array, IEEE Trans. ComputerAided Design, vol. CAD2, pp. 301312, Oct. 1983.
2. T. C. Hu and M. T. Shing, A decomposition algorithm for circuit routing, in VLSI Circuit Layout: Theory and Design. T. C. Hu and E. S. Kuh, Eds., New York: IEEE, 1985, pp. 144152.
3. A. Vannelli, An interior point method for solving the global routing problem, in IEEE Proc. Custom Integrated Circuits Conf., 1989, pp. 3.4.13.4.4.
4. An adaptation of the interior point method for solving the global routing problem. IEEE Trans. ComputerAided Design, vol. 10, pp. 193203, Feb. 1991.
5. R. M. Karp, F. T. Lcighton, R. L. Rivcst, C. D. Thompson, U. V. Vazirani, and V. V. Varizani, Global wire routing in twodimensional arrays, Algorithmica, vol. 2, pp. 113129, 1987.
6. M. Burstein and R. Pelavin, Hierarchical wire routing, IEEE Trans. ComputerAided Design, vol. CAD2, pp. 223234, Oct. 1983.
7. E. Shragowitz and S. Keel, A global router based on a multicommodity flow model, Integration, the VLSI J., vol. 5, pp. 316, 1987.
8. P. Raghavan and C. D. Thompson, Multiterminal global routing: A deterministic approximation scheme, Algorithmica, vol. 6, pp. 7382, 1991.
9. T. C. Hu, Integer Programming and Network Flows. Reading, MA: AddisonWesley, 1969.
10. G. Meixner and U. Lauther, A new global router based on a flow model and linear assignment, in IEEE Proc. Int. Conf. ComputerAided Design, 1990, pp. 4447.
11. N. Karmarkar, A new polynomialtime algorithm for linear programming, Combinatorica, vol. 4, pp. 373395, 1984.
12. P. Raghavan, Lecture notes on randomized algorithms, Res. Rep. RC 15340 (#68237) 1/9/90, IBM Res. Div., T. J. Watson Res. Center, Yorktown Heights, NY, 1990.
13. E. S. Kuh and M. MarckSadowska, Global routing, in Layout Design and Verification, T. Ohtsuki, Ed. Amsterdam, The Netherlands: North Holland, 1986.
14. T. M. Parng and R. S. Tsay, A new approach to seaofgates global routing, in IEEE Proc. Int. Conf. ComputerAided Design, 1989, pp. 5255.
15. K. W. Lee and C. Sechen. A global router for seaofgates circuits, in Proc. European Design Automation Conf., 1991, pp. 242247.
16. C. Chiang, M. Sarrafzadeh, and C. K. Wong, A powerful global router: Based on Steiner minmax trees, in IEEE Proc. Int. Conf. ComputerAided Design, 1989, pp. 25.
17. C. Chiang, C. K. Wong, and M. Sarrafzadeh, A weighted steiner treebased global router with simultaneous length and density minimization, IEEE Trans. ComputerAided Design, vol. 13, pp. 1461 1469, Dec. 1994.
18. C. Chiang, M. Sarrafzadeh, and C. K. Wong, Global routing based on steiner minmax trees, IEEE Trans. ComputerAided Design, vol. 9, pp. 13181325, Dec. 1990.
19. J. M. Ho, G. Vijayan, and C. K. Wong, Constructing the optimal rectilinear steiner tree derivable from a minimum spanning tree, in IEEE Proc. Int. Conf. ComputerAided Design, 1989, pp. 69.
20. R. C. Carden and C. K. Cheng, A global router using an efficient approximate multicommodity multiterminal flow algorithm. in ACM/IEEE Proc. 28th Design Automation Conf., June, 1991, pp. 316321.
21. F. Shabrokhi and D. W. Matula, The maximum concurrent flow problem, in J. Assoc. Computing Machinery, Apr. 1990, pp. 318334.
22. M. V. Lomonosov, Combinatorial approaches to multiflow problems, Discrete Appl Mathematics, vol. 11, pp. 194, 1985.
23. W. R. Pulleyblank, Two steiner tree packing problems, in ACM Proc. 25th Ann. Symp. Theory Computing, 1995, pp. 383387.
24. T. C. Hu, Combinatorial Algorithms. Reading, MA: AddisonWesley, 1982.
25. D. Cobb, private communication, Sept. 1990, MCC, Austin, TX.
26. R. C. Carden and C. K. Cheng, Feasibility estimation and cost optimization for multichip module technologies, in IEEE Proc. 4th ASIC Conf., Sept. 1991, pp. 14.