A Weighted Steiner Tree-Based Global Router with Simultaneous Length and Density Minimization

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

Volumn 13, Issue 12, 1994, Pages 1461-1469

  Chiang, C ^a   Wong, C K ^b   Sarrafzadeh, M ^c  

^a IBM   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Global routing; length density minimization; sequential approach; weighted Steiner tree

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INTEGRATED CIRCUITS; STANDARDS; WIRE;

GLOBAL ROUTING; LENGTH DENSITY MINIMIZATION; SEQUENTIAL APPROACH; WEIGHTED STEINER TREE;

INTEGRATED CIRCUIT LAYOUT;

EID: 0028745111     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.331403     Document Type: Article

References (34)

1. P. K. Agarwal and M. T. Shing, “Algorithm for special cases of rectilinear steiner trees: I. points on the boundary of a rectilinear rectangle,” Networks, vol. 20, no. 4, pp. 453-485, July 1990.
2. A. Aoshima and E. Kuh, “Multi-channel optimization in gate array LSI layout,” in Proc. IEEE Int. Conf. Computer-Aided Design, Nov. 1983.
3. M. Burstein and R. Pelavin, “Hierarchical wire routing,” IEEE Trans. Computer-Aided Design, vol. CAD-2, no. 4, pp. 223-234, Oct. 1983.
4. R. C. Carden, IV and C. K. Cheng, “A global router using an efficient approximate multicommodity multiterminal flow algorithm,” in Proc. IEEE/ACM Design Automation Conf., 1991, pp. 316-321.
5. C. Chiang, M. Sarrafzadeh, and C. K. Wong, “An optimal algorithm for rectilinear steiner trees for channels with obstacles,” Int. J. Circuit Theory and Appl., Special Issue on Fundamental Methods in Computer-Aided Aided Circuit Design, vol. 19, no. 6, pp. 551-563, Dec. 1991.
6. C. Chiang, M. Sarrafzadeh, and C. K. Wong, “Global routing based on Steiner min-max trees,” IEEE Trans. Computer-Aided Design, vol. 9, no. 12, pp. 1315-1325, 1990.
7. C. Chiang, M. Sarrafzadeh, and C. K. Wong, “An optimal algorithm for constructing a steiner tree in a switchbox. Part 1: Fundamental Theory and Application" IEEE Trans. Circuits Syst., vol. 39, no. 6, 1992.
8. J. P. Cohoon, D. S. Richards, and J. S. Salowe, “An optimal steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle,” IEEE Trans. Computer-Aided Design, vol. 9, no. 4, pp. 398-407, Apr. 1990.
9. E. W. Dijkstra, “A note on two problems in connection with graphs,” Numerische Mathematik, vol. 1, pp. 269-271, 1959.
10. M. R. Garey and D. S. Johnson, “The rectilinear Steiner tree problem is NP-complete,” SIAM J. Appl. Math., vol. 32, no. 4, pp. 826-834, Apr. 1977.
11. J. M. Ho, G. Vijayan, and C. K. Wong, “New algorithm for the rectili near Steiner tree problem,” IEEE Trans. Computer-Aided Design, vol. 9, no. 2, pp. 185-193, Feb. 1990.
12. T. C. Hu and M. T. Shing, “The alpha-beta routing,” in VLSI Layout: Theory and Design. New York: IEEE Press, 1985, pp. 139-143.
13. F. K. Hwang, “On Steiner minimal trees with rectilinear distance,” SIAM J. Appl. Math., vol. 30, no. 1, pp. 104-114, Jan. 1976.
14. R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani, “Global wire routing in two-dimensional arrays,” Algorithmica, vol. 2, no. 1, pp. 113-129, 1987.
15. L. Kou, G. Markowsky, and L. Berman, “A fast algorithm for steiner trees,” Acta lnformatica. vol. 15, pp. 141-145, 1981.
16. E. S. Kuh and M. Marek-Sadowska, “Layout design and verification,” in Advances in CAD for VLSI. Amsterdam, The Netherlands: Elsevier Science Publishing, T. Ohtsuki, Ed., vol. 4, 1986.
17. J. H. Lee, N. K. Bose, and F. K. Hwang, “Use of steiner's problem in sub-optimal routing in rectilinear metric,” IEEE Trans. Circuits Syst., vol. CAS-23, pp. 470-476, July 1976.
18. K.-W. Lee and C. Sechen, “A new global router for row-based layout,” in Proc. IEEE Int. Conf. Computer-Aided Design, Nov. 1988, pp. 180-183.
19. K. W. Lee and Carl Sechen, “A global router for sea-of-gates circuits,” in Proc. IEEE European Design Automation Conf., Feb. 1991, pp. 242-247.
20. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, New York: John Wiley & Sons, 1990.
21. T. Lengauer and M. Lugering, “Integer programming formulation of global routing and placement problems,” in World Scientific, Special volume on Algorithm Aspects of VLSI Layout. M. Sarrafzadeh and D. T. Lee, Ed., 1993.
22. J. T. Li and M. Marek-Sadowska, “Global routing for gate arrays,” IEEE Trans. Computer-Aided Design, vol. CAD-3, no. 4, pp. 298-307, Oct. 1984.
23. W. K. Luk, P. Sipala, M. Tamminen, D. Tang, L. S. Woo, and C. K. Wong, “A hierarchical global wiring algorithm for custom chip design,” IEEE Trans. Computer Aided Design,” vol. CAD-6, no. 4, pp. 518-533, July 1987.
24. M. Marek-Sadowska and M. Sarrafzadeh, “The crossing distribution problems,” in Proc. Int. Conf. Computer-Aided Design, 1991, pp. 528-531.
25. R. Nair, “A simple yet effective technique for global wiring,” IEEE Trans. Computer-Aided Design. vol. CAD-6, no. 2, pp. 165-172, Mar. 1987.
26. R. C. Prim, “Shortest connection networks and some generalizations,” Bell System Tech. J., vol. 36, pp. 1389-1401, 1957.
27. P. Raghavan and C. D. Thompson, “Andomized routing: A technique for provable good algorithms and algorithmic proofs,” Combinatorica, vol. 7, no. 4, pp. 365-374, 1987.
28. M. Sarrafzadeh and C. K. Wong, “New directions in the rectilinear steiner tree problem,” manuscript, 1991.
29. M. Sarrafzadeh and C. K. Wong, “Hierarchical steiner tree construction in uniform orientations,” IEEE Trans. Computer-Aided Design, vol. 11, no. 8, pp. 1095-1103, Sept. 1992.
30. M. Sarrafzadeh and D. Zhou, “Global routing of short nets in two-dimensional dimensional arrays,” Int. J. Computer-Aided VLSI Design, vol. 2, no, 2, pp. 197-211, 1990.
31. E. Shargowitz and J. Keel, “A Global router based on multicommodity flow model,” INTEGRATION: The VLSI J., vol. 5, pp. 3-16, 1987.
32. B. S. Ting and B. N. Tien, “Routing techniques for gate arrays,” IEEE Trans. Computer-Aided Design, vol. CAD-2, no. 4, pp. 301-312, Oct. 1983.
33. M. P. Vecchi and S. Kirkpatrick, “Global Wiring by Simulated Annealing,” IEEE Trans. Computer-Aided Design, vol. CAD-2, no. 4, pp. 215-222, 1983.
34. Y. F. Wu, P. Widmayer, M. D. F. Schlag, and C. K. Wong, “Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles,” IEEE Trans. Computer- Aided Design, vol. 36, no. 3, pp. 321-331, 1987.