Creating and exploiting flexibility in rectilinear Steiner trees

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

Volumn 22, Issue 5, 2003, Pages 605-615

  Bozorgzadeh, Elaheh ^a   Kastner, Ryan ^b   Sarrafzadeh, Majid ^a  

^a Department of Civil and Environmental Engineering   (United States)

^b Santa Barbara   (United States)

Author keywords

Global routing; Optimization; Steiner tree; Very large scale integrated computer aided design

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS); VLSI CIRCUITS;

CIRCUIT ROUTABILITY; GLOBAL ROUTING PROBLEM; STEINER TREES;

INTEGRATED CIRCUIT LAYOUT;

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

References (21)

1. R. Kastner and M. Sarrafzadeh. (1999) Labyrinth: A Global Router and Development Tool. [Online]. Available: URL:http://www.cs.ucla.edu/kastner/labyrinth/
2. F. K. Hwang, D. S. Richards, and P. Winter, "The Steiner tree problem," in Annals of Discrete Mathematics. Amsterdam, The Netherlands: North-Holland, 1992, vol. 53, pp. 203-282.
3. C. Albrecht, "Provably good global routing by a new approximation algorithm for multicommodity flow," in Proc. ACM/SIGDA Int. Symp. Physical Design, Apr. 2000, pp. 19-25.
4. 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, vol. 15, pp. 208-216, Feb. 1996.
5. C. Chiang, C. K. Wong, and M. Sarrafzadeh, "A weighted Steiner trees-based global router with simultaneous length and density minimization," IEEE Trans. Computer-Aided Design, vol. 13, pp. 1461-1469, Dec. 1994.
6. X. Hong, T. Xue, E. S. Kuh, C. K. Cheng, and J. Huang, "Performance-driven Steiner tree algorithm for global routing," in Proc. ACM/IEEE Design Automation Conf., 1993, pp. 177-181.
7. E. Bozorgzadeh, R. Kastner, and M. Sarrafzadeh, "Creating and exploiting flexibility in Steiner trees," in Proc. ACM/IEEE Design Automation Conf., June 2001, pp. 195-198.
8. R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh, "Pattern routing: Use and theory for increasing predictability and avoiding coupling," IEEE Trans. Computer-Aided Design, vol. 21, pp. 777-791, July 2002.
9. A. Caldwell, A. Kahng, and I. Markov, "Can recursive bisection alone produce routable placements?," in Proc. 37th ACM/IEEE Design Automation Conf., June 2000, pp. 477-482.
10. J. Hu and S. Sapatnekar, "A timing-constrained algorithm for simultaneous global routing of multiple nets," in Proc. ACM/IEEE Int. Conf. Computer-Aided Design, Nov. 2000, pp. 99-103.
11. A. Jagannathan, S.-W. Hur, and J. Lillis, "A fast algorithm for context-aware buffer insertion," in Proc. 37th ACM/IEEE Design Automation Conf., June 2000, pp. 368-373.
12. C. Albert "The ISPD98 circuit benchmark suite," in Proc. Int. Symp. Physical Design, Apr. 1998, pp. 80-85.
13. E. F. Moore, The Shortest Path Through a Maze, 1959, pt. II, vol. 30, Annals of the Harvard Computation Laboratory.
14. M. Garey and D. Johnson, "The rectilinear Steiner tree problem is NP-complete," SIAM J. Appl. Math., pp. 826-834.
15. J. Cong and X. Yuan, "Routing tree construction under fixed buffer locations," in Proc. 37th ACM/IEEE Design Automation Conf., June 2000, pp. 379-384.
16. J. Ho, G. Vijayan, and C. K. Wong, "A new approach to the rectilinear Steiner tree problem," in Proc. ACM/IEEE Design Automation Conf., June 1989, pp. 161-166.
17. K. Kozminski, "Benchmarks for layout synthesis - Evolution and current status," in Proc. ACM/IEEE Design Automation Conf., June 1991, pp. 265-270.
18. M. Lai and D. F. Wong, "Maze routing with buffer insertion and wire sizing," in Proc. ACM/IEEE Design Automation Conf., June 2000, pp. 374-378.
19. M. Sarrafzadeh and C. K. Wong, An Introduction to VLSI Physical Design. New York: McGraw-Hill, 1996.
20. M. Wang, X. Yang, and M. Sarrafzadeh, "DRAGON: Fast standard-cell placement for large circuits," in Proc. IEEE Int. Conf. Computer-Aided Design, Nov. 2000, pp. 260-263.
21. W. J. Sun and C. Sechen, "Efficient and effective placement for very large circuits," in Proc. Int. Conf. Computer-Aided Design, Nov. 1993, pp. 170-177.