DpRouter: A fast and accurate dynamic-pattern-based global routing algorithm

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2007, Pages 256-261

  Cao, Zhen ^a   Jing, Tong ^a,b   Xiong, Jinjun ^b,c   Hu, Yu ^b   He, Lei ^b   Hong, Xianlong ^a  

^a TSINGHUA UNIVERSITY   (China)

^b University of California   (United States)

^c IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; DIGITAL INTEGRATED CIRCUITS; INDUSTRIAL ENGINEERING; MECHANIZATION; NETWORK ROUTING;

DESIGN AUTOMATION CONFERENCE (DAC); EXPERIMENTAL RESULTS; GLOBAL ROUTING; ROUTABILITY; RUN TIME; SOLUTION SPACES; SOUTH PACIFIC; TIME COMPLEXITIES; WIRE LENGTHS;

ROUTING ALGORITHMS;

EID: 46649106517     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2007.357995     Document Type: Conference Paper

References (12)

1. C. Chiang, M. Sarrafzadeh, and C.K. Wong, "Global routing based on steiner min-max trees", IEEE Trans. on CAD, 1990, 9(12): pp.1318-1325.
2. W. Swartz and C. Sechen, "A new generalized row-basedglobal router", In Proc. of DAC, 1993, pp.491-498.
3. R. C. Carden IV, J. M. Li, and C. K. Cheng, "A global router with a theoretical bound on the optimal solution", IEEE Trans. on CAD, 1996, 15(2): pp.208-216.
4. C. Albrecht, "Provably good global routing by a new approximation algorithm for multicommodity flow". In Proc. of ISPD, 2000, pp. 19-25.
5. T. Jing, X.L. Hong, H.Y. Bao, J.Y. Xu, and J. Gu, "SSTT: Efficient local search for GSI global routing", Journal of Compute Science and Technology, 2003, 18(5): pp.632-639.
6. R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh, "Pattern routing: use and theory for increasing predictability and avoiding coupling," IEEE Trans. on CAD, 2002, 21(7): pp.777-790.
7. Labyrinth, http://www.ece.ucsb.edu/~kastner/labyrinth/
8. R.T. Hadsell and P.H. Madden, "Improved global routing through congestion estimation," In Proc. of DAC, 2003, pp.28-31.
9. C. Chu, "FLUTE: fast lookup table based wirelength estimation technique", In Proc. of ICCAD, 2004, pp. 696-701.
10. C. Chu and Y. Wong, "Fast and accurate rectilinear Steiner minimal tree algorithm for VLSI design," In Proc. of ISPD, 2005, pp. 28-35.
11. E. Bozorgzadeh, R. Kastner, and M. Sarrafzadeh, "Creating and exploiting flexibility in rectilinear Steiner trees," IEEE Trans. on CAD, 2003, 22(5): pp.605-615.
12. M. Hanan, "On Steiner's problem with rectilinear distance", SIAM J. on Applied Mathematics, 1966, 14: pp.255-265