Spanning graph-based nonrectilinear steiner tree algorithms

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

Volumn 24, Issue 7, 2005, Pages 1066-1075

  Zhu, Qi ^a,b   Zhou, Hai ^c   Jing, Tong ^a   Hong, Xian Long ^a   Yang, Yang ^a  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Northwestern University   (United States)

Author keywords

Deep submicron (DSM); Interconnect; Physical design; Routing; Steiner tree; Very large scale integration (VLSI)

Indexed keywords

COMPUTER ARCHITECTURE; HEURISTIC METHODS; LARGE SCALE SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; ROUTERS; TREES (MATHEMATICS); ULSI CIRCUITS; VLSI CIRCUITS;

DEEP SUBMICRON (DSM); INTERCONNECT; PHYSICAL DESIGN; STEINER TREE;

GRAPHIC METHODS;

EID: 22544443621     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2005.850862     Document Type: Article

References (31)

1. R. C. Carden IV, J. M. Li, and C. K. Cheng, "A global router with a theoretical bound on the optimal solution," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 15, no. 2, pp. 208-216, Feb. 1996.
2. T. Jing, X. L. Hong, H. Y. Bao, J. Y. Xu, and J. Gu, "SSTT: efficient local search for GSI global routing," J. Comput. Sci. Technol., vol. 18, no. 5, pp. 632-639, 2003.
3. T. Jing, X. L. Hong, J. Y. Xu, H. Y. Bao, C. K. Cheng, and J. Gu, "UTACO: A unified timing and congestion optimization algorithm for standard cell global routing," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 23, no. 3, pp. 358-365, Mar. 2004.
4. S. P. Lin and Y. W. Chang, "A novel framework for multilevel routing considering routability and performance," in Proc. IEEE/ACM Int. Conf. Computer Aided Design (ICCAD), 2002, pp. 44-50.
5. C. C. N. Chu and D. F. Wong, "An efficient and optimal algorithm for simultaneous buffer and wire sizing," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 18, no. 9, pp. 1297-1304, Sep. 1999.
6. H. Xiang, X. P. Tang, and D. F. Wong, "An algorithm for integrated pin assignment and buffer planning," in Proc. ACM/IEEE Design Automation Conf. (DAC), 2002, pp. 584-589.
7. X. L. Hong, T. Jing, J. Y. Xu, H. Y. Bao, and J. Gu, "CNB: A critical-network-based timing optimization method for standard cell global routing," J. Comput. Sci. Technol., vol. 18, no. 6, pp. 732-738, 2003.
8. J. Y. Xu, X. L. Hong, T. Jing, Y. C. Cai, and J. Gu, "A novel timing-driven global routing algorithm considering coupling effects for high performance circuit design," IEICE Trans. Fundamentals ECCS, vol. E86-A, no. 12, pp. 3158-3167, 2003.
9. Y. Wang, X. L. Hong, T. Jing, Y. Yang, X. D. Hu, and G. Y. Yan, "An efficient low-degree RMST algorithm for VLSI/ULSI physical design," in Lecture Notes in Computer Science (LNCS) 3254 - Integrated Circuit and System Design, Springer, Germany, Santorini, Greece, Sep. 2004, pp. 442-452.
10. J. Y. Xu, X. L. Hong, T. Jing, Y. C. Cai, and J. Gu, "An efficient hierarchical timing-driven Steiner tree algorithm for global routing," Integration, VLSI J., vol. 35, no. 2, pp. 69-84, 2003.
11. M. Sarrafzadeh and C. K. Wong, "Hierarchical Steiner tree construction in uniform orientations," IEEE Trans. Computer-Aided Design Integr. Circuits Syst, vol. 11, no. 9, pp. 1095-1103, Sep. 1992.
12. C. K. Koh, "Steiner problem in octilinear routing model," Master's thesis, Dept. of Computer Science, National Univ. of Singapore, Singapore, 1995.
13. D. T. Lee, C. F. Shen, and C. L. Ding, "On Steiner tree problem with 45° routing," in Proc IEEE Int. Symp. Circuits Systems (ISCAS), Seattle, WA, 1995, pp. 1680-1682.
14. G. Robins, "On optimal interconnections," Ph.D. dissertation, Dept. of Computer Science, Univ. of California, Los Angeles, 1992.
15. C. K. Koh and P. H. Madden, "Manhattan or non-Manhattan? A study of alternative VLSI routing architectures," in Proc. Great Lakes Symp. VLSI, San Diego, CA, 2000, pp. 47-52.
16. S. L. Teig, "The X architecture: Not your father's diagonal wiring," in Int. Workshop System Level Interconnect Prediction (SLIP), San Diego, CA, 2002, pp. 33-37.
17. C. Chiang and C. S. Chiang, "Octilinear Steiner tree construction," presented at the IEEE Int. Midwest Symp. Circuits Systems (MWSCAS), Tulsa, OK, 2002, Paper TAM11-216.
18. [Online]. Available: http://www.xinitiative.org/
19. A. B. Kahng, I. I. Mandoiu, and A. Z. Zelikovsky, "Highly scalable algorithms for rectilinear and octilinear Steiner trees," presented at the Asia-Pacific Design Automation Conf. (ASP-DAC), Kitakyushu, Japan, Jan. 2003.
20. A. Zelikovsky, "An 11/6-approximation algorithm for the network Steiner problem," Algorithmica, vol. 9, pp. 463-470, 1993.
21. A. B. Kahng and G. Robins, "A new class of Steiner tree heuristics with good performance," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 11, no. 7, pp. 893-902, Jul. 1992.
22. C. S. Coulston, "Constructing exact octagonal Steiner minimal tree," presented at the Great Lakes Symp. VLSI (GLSVLSI), Washington, DC, Apr. 28-29, 2003.
23. M. Borah, R. M. Owens, and M. J. Irwin, "An edge-based heuristic for Steiner routing," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 13, no. 12, pp. 1563-1568, Dec. 1994.
24. H. Zhou, N. Shenoy, and W. Nicholls, "Efficient spanning tree construction without Delaney triangulation," Inf. Process. Lett., vol. 81, no. 5, 2002.
25. F. K. Hwang, "An O(n log n) algorithm for rectilinear minimal spanning trees," J. ACM, vol. 26, no. 2, pp. 177-182, Apr. 1979.
26. U. Foßmeier, M. Kaufmann, and A. Zelikovsky, "Faster approximation algorithms for the rectilinear Steiner tree problem," Discrete Computational Geometry, vol. 18, no. 1, pp. 93-109, 1997.
27. T. H. Cormen, C. E. Leiserson, and R. H. Rivest, Introduction to Algorithm. Cambridge, MA: MIT Press, 1989.
28. H. Zhou, "Efficient Steiner tree construction based on spanning graphs," presented at the ACM Int. Symp. Physical Design, Monterey, CA, Apr. 2003.
29. P. Widmayer, Y. F. Wu, and C. K. Wong, "On some distance problems in fixed orientations," SIAM J. Comp., vol. 16, no. 4, pp. 728-746, Aug. 1987.
30. Q. Zhu, H. Zhou, T. Jing, X. Hong, and Y. Yang, "Efficient octilinear Steiner tree construction based on spanning graphs," in Proc. IEEE/ACM Asian-Pacific Design Automation Conf. (ASP-DAC), Yokohama, Japan, 2004, pp. 687-690.
31. H. Zhou, "Efficient Steiner tree construction based on spanning graphs," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 23, no. 5, pp. 704-710, May 2004.