Fashion: A fast and accurate solution to global routing problem

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

Volumn 27, Issue 4, 2008, Pages 726-737

  Cao, Zhen ^b,c   Jing, Tom Tong ^a,c   Xiong, Jinjun ^a,c,d   Hu, Yu ^a,c   Feng, Zhe ^b,c   He, Lei ^a,c   Hong, Xian Long ^a,b  

^a IEEE

^b TSINGHUA UNIVERSITY   (China)

^c Engineering IV   (United States)

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

Author keywords

Flexibility; Global routing; Physical design; Routability; Steiner tree

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER AIDED DESIGN; ROUTERS;

DYNAMIC PATTERN ROUTING (DPR); GLOBAL ROUTING; PHYSICAL DESIGN; ROUTABILITY; STEINER TREE;

NETWORK ROUTING;

EID: 41549140997     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2008.917590     Document Type: Conference Paper

References (18)

1. M. Sarrafzadeh, C. Chiang, and C. Wong, "Global routing based on Steiner min-max trees," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 9, no. 12, pp. 1318-1325, Dec. 1990.
2. W. Swartz and C. Sechen, "A new generalized row-based global router," in Proc. Des. Autom. Conf.,1993, pp. 491-498.
3. J. Li, R. C. Carden, IV, and C. K. Cheng, "A global router with a theoretical bound on the optimal solution," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 15, no. 2. pp. 208-216, Feb. 1996.
4. C. Albrecht, "Provably good global routing by a new approximation algorithm for multicommodity flow," in Proc. Int. Symp. Phys. Des., 2000, pp. 19-25.
5. E. Bozorgzadeh, R. Kastner, and M. Sarrafzadeh, "Pattern routing: Use and theory for increasing predictability and avoiding coupling," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 21, no. 7, pp. 777-790, Jul. 2002.
6. Labyrinth. [Online]. Available: http://www.ece.ucsb.edu/~kastner/ labyrinth
7. T. Jing, X. Hong, H. Bao, J. Xu, and J. Gu, "SSTT: Efficient local search for GSI global routing," J. Comput. Sci. Technol., vol. 18, no. 5, pp. 632-639, Sep. 2003.
8. R. Hadsell and P. Madden, "Improved global routing through congestion estimation," in Proc. Des. Autom. Conf.,2003, pp. 28-31.
9. M. Cho and D. Pan, "BoxRouter: A new global router based on box expansion and progressive ILP," in Proc. Des. Autom. Conf.,2006, pp. 373-378.
10. M. Pan and C. Chu, "FastRoute: A step to integrate global routing into placement," in Proc. Int. Conf. Comput.-Aided Des., 2006, pp. 464-471.
11. D. Jariwala and J. Lillis, "Trunk decomposition based global routing optimization," in Proc. Int. Conf. Comput.-Aided Des., 2006, pp. 472-479.
12. M. Pan and C. Chu, "FastRoute 2.0: A high-quality and efficient global router," in Proc. Asia South Pacific Des. Autom. Conf.,2007, pp. 250-255.
13. C. Chu, "FLUTE: Fast lookup table based wirelength estimation technique," in Proc. Int. Conf. Comput.-Aided Des., 2004, pp. 696-701.
14. C. Chu and Y. Wong, "Fast and accurate rectilinear Steiner minimal tree algorithm for VLSI design," in Proc. Int. Symp. Phys. Des., 2005, pp. 28-35.
15. R. Kastner, E. Bozorgzadeh, and M. Sanafzadeh, "Creating and exploiting flexibility in rectilinear Steiner trees," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 22, no. 5, pp. 605-615, May 2003.
16. M. Hanan, "On Steiner's problem with rectilinear distance," SIAM J. Appl. Math., vol. 14, no. 2, pp. 255-265, Mar. 1966.
17. C. Alpert, "The ISPD98 circuit benchmark suite," in Proc. Int. Symp. Phys. Des., 1998, pp. 80-85.
18. Z. Cao, T. Jing, J. Xiong, Y. Hu, L. He, and X. Hong, "DpRouter: A fast and accurate dynamic-pattern-based global routing algorithm," in Proc. Asia South Pacific Des. Autom. Conf.,2007, pp. 256-261.