Global Routing Based on Steiner Min-Max Trees

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

Volumn 9, Issue 12, 1990, Pages 1318-1325

  Chiang, Charles ^a   Sarrafzadeh, Majid ^a   Wong, C K ^b  

^a NORTHWESTERN UNIVERSITY   (United States)

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

Author keywords

difficult examples; gate array; Global routing; greedy approach; master slice chips; optimal algorithm; Steiner min max tree

Indexed keywords

COMPUTER METATHEORY--COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING--ALGORITHMS;

GATE ARRAYS; GLOBAL ROUTING; GREEDY APPROACH; MULTITERMINAL NETS; OPTIMAL ALGORITHM; STEINER MIN-MAX TREES;

INTEGRATED CIRCUITS;

EID: 0025594168     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.62776     Document Type: Article

References (26)

1. A. Aoshima and E. Kuh, “Multi-channel optimization in gate array LSI layout,” in Proc. IEEE Int. Conf. Computer-Aided Design, 1983.
2. M. Burstein and R. Pelavin, “Hierarchical wire routing,” IEEE Trans. Computer-Aided Design, vol. CAD-6. pp. 223–234. Oct. 1987.
3. 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, pp. 398– 407, Apr. 1990.
4. F. K. Hwang, “On Steiner minimal trees with rectilinear distance,” SIAMJ. ofAppl. Math., vol. 30, pp. 104–114, Jan. 1976.
5. J. M. Ho, G. Vijayan, and C. K. Wong, “A new approach to the rectilinear Steiner tree problem,” IEEE Trans. Computer-Aided Design, vol. 9, pp. 185–193, Feb. 1990.
6. J. B. Kruskal, Jr, “On the shortest spanning subtree of a graph and the traveling salesman problem,” in Proc. Amer. Math. Soc, vol. 7, no. 1, 1956, pp. 48–50.
7. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations. Plenum Press, 1972, pp. 85– 163.
8. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Sci., vol. 220, pp. 671–680, 1983.
9. O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problem—Part I: The p-centers,” unpublished manuscript.
10. R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. Vaziriani, V. Vaziriani,” “Global routing in two-dimensional arrays,” Algorithmica, vol. 2, no. 1, pp. 113–130, 1987.
11. E. S. Kuh and M. Marek-Sadowska, “Global routing,” in Layout Design and Verification, T. Ohtsuki, ed. New York: Elsevier Science, 1986.
12. C. Y. Lee, “An algorithm for path connection and its application,” IRE Trans. Electron. Comput., vol. EC-10, pp. 346–365, 1961.
13. D. Lichtenstein, “Planar formulae and their uses,” SIAM J. Corn-put., vol. 11, 1982, pp. 329–343.
14. R. Linsker, “An iterative improvement penalty function drive wire routing system,” IBM J. Res. Develop., vol. 28, no. 5, pp. 613–624, Sept. 1984.
15. 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.
16. J. T. Li and M. Marek-Sadowska, “Global routing for gate arrays,” IEEE Trans. Computer-Aided Design, vol. CAD-3, pp. 298–307, Oct. 1984.
17. K.-W. Lee and C. Sechen, “A new global router for row-based layout,” in Proc. IEEE Int. Conf. on Computer-Aided Design, Nov. 7– 10, 1988, pp. 180–183.
18. 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, pp. 518– 533, July 1987.
19. E. F. Moore, “Shortest path through a maze,” Annals of Computation Laboratory. Cambridge, MA: Harvard University Press, 1959, pp. 285–292.
20. R. Nair, “A simple yet effective technique for global routing,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 165–172, 1987.
21. R. C. Prim, “Shortest connection networks and some generalizations,” Bell Syst. Tech. J., no. 36, pp. 1389–1401, 1957.
22. M. Sarrafzadeh and D. Zhou, “Global routing of short nets in two-dimensional arrays,” The Int. J. Computer Aided VLSI Design, vol. 2, no. 2, pp. 197–211, 1990.
23. E. Shargowitz and J. Keel, “A global router based on multicommod-ity flow model,” INTEGRATION: The VLSI J., vol. 5, pp. 3–16, 1987.
24. B. S. Ting and B. N. Tien, “Routing techniques for gate arrays,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 301–312, Oct. 1983.
25. M. P. Vecchi and S. Kirkpatrick, “Global wiring by simulated annealing,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 215–222, 1983.
26. A. Yao, “An 0(\E\ loglog |E|) algorithm for finding minimum spanning trees,” Inform. Proc. Lett., vol. 4, pp. 21–23, 1975.