MAIZEROUTER: Engineering an effective global router

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

Volumn 27, Issue 11, 2008, Pages 2017-2026

  Moffitt, Michael D ^a  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

Algorithms; Design automation; Optimization; Routing

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER NETWORKS; ROUTERS;

ACCURATE; COST INFORMATIONS; DESIGN AUTOMATION; DYNAMIC COSTS; EFFICIENT REDUCTIONS; GLOBAL ROUTERS; INCREMENTAL; PATH COMPUTATIONS; ROUTING; ROUTING CONGESTIONS; ROUTING RESOURCES; ROUTING TOOLS; SEARCH SPACES; SHIFTING; SIMPLE OPERATIONS; VARIATIONS OF; WIRELENGTH;

ROUTING ALGORITHMS;

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

References (37)

1. C. Albrecht, "Global routing by new approximation algorithms for multicommodity flow," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 20, no. 5, pp. 622-632, May 2001.
2. 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. ASP-DAC, pp. 256-261.
3. R. C. Garden, IV, J. Li, 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. M. Cho, K. Lu, K. Yuan, and D. Z. Pan, "BoxRouter 2.0: Architecture and implementation of a hybrid and robust global router," in Proc. ICCAD, 2007, pp. 503-508.
5. M. Cho and D. Z. Pan, "BoxRouter: A new global router based on box expansion and progressive ILP," in Proc. DAC, 2006, pp. 373-378.
6. C. Chu, "FLUTE: Fast lookup table based wirelength estimation technique," in Proc. ICCAD, 2004, pp. 696-701.
7. C. C. N. Chu and Y.-C. Wong, "Fast and accurate rectilinear Steiner minimal tree algorithm for VLSI design," in Proc. ISPD, 2005, pp. 28-35.
8. J.-R. Gao, P.-C. Wu, and T.-C. Wang, "A new global router for modern designs," in Proc. ASP-DAC, 2008, pp. 232-237.
9. R. Goering, IC Routing Contest Boosts CAD Research, 2007. [Online]. Available: www.eetimes.com/showArticle.jhtml?articleID=198500084
10. R. T. Hadsell and P. H. Madden, "Improved global routing through congestion estimation," in Proc. DAC, 2003, pp. 28-31.
11. M. Hanan, "On Steiner's problem with rectilinear distance," SIAM J. Appl. Math., vol. 14, no. 2, pp. 255-265, Mar. 1966.
12. J. Hu and S. S. Sapatnekar, "A survey on multi-net global routing for integrated circuits," Integr. VLSI J., vol. 31, no. 1, pp. 1-49, Nov. 2001.
13. A. Kahng, I. Mandoiu, and A. Zelikovsky, "Highly scalable algorithms for rectilinear and octilinear Steiner trees," in Proc. ASP-DAC, 2003, pp. 827-833.
14. A. B. Kahng and X. Xu, "Accurate pseudo-constructive wirelength and congestion estimation," in Proc. SLIP, 2003, pp. 61-68.
15. R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh, "Predictable routing," in Proc. ICCAD, 2000, pp. 110-113.
16. R. Kastner, E. Bozorgzadeh, 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.
17. Z. Li, C. J. Alpert, S. T. Quay, S. S. Sapatnekar, and W. Shi, "Probabilistic congestion prediction with partial blockages," in Proc. ISQED, 2007, pp. 841-846.
18. C.-W. Lin, S.-Y. Chen, C.-F. Li, Y.-W. Chang, and C.-L. Yang, "Efficient obstacle-avoiding rectilinear Steiner tree construction," in Proc. ISPD, 2007, pp. 127-134.
19. J. Lou, S. Krishnamoorthy, and H. S. Sheng, "Estimating routing congestion using probabilistic analysis," in Proc. ISPD, 2001, pp. 112-117.
20. M. D. Moffitt, "MaizeRouter: Engineering an effective global router," in Proc. ASP-DAC, 2008, pp. 226-231.
21. M. M. Ozdal and M. D. F. Wong, "Archer: A history-driven global routing algorithm," in Proc. ICCAD, 2007, pp. 488-495.
22. M. Pan and C. Chu, "FastRoute: A step to integrate global routing into placement," in Proc. ICCAD, 2006, pp. 464-471.
23. M. Pan and C. Chu, "FastRoute 2.0: A high-quality and efficient global router," in Proc. ASP-DAC, 2007, pp. 250-255.
24. M. Pan and C. Chu, "IPR: An integrated placement and routing algorithm," in Pmc. DAC, 2007, pp. 59-62.
25. J. Roy and I. L. Markov, "High-performance routing at the nanometer scale," in Proc. ICCAD, 2007, pp. 496-502.
26. Electronic Design Automation for Integrated Circuits Handbook, L. K. Scheffer, L. Lavagno, and G. Martin, Eds. Boca Raton, FL: CRC Press, 2006, ch. 8: Routing.
27. C.-W. Sham and E. F. Y. Young, "Congestion prediction in early stages," in Proc. SLIP, 2005, pp. 91-98.
28. J. Westra, C. Bartels, and P. Groeneveld, "Probabilistic congestion prediction," in Proc. ISPD, 2004, pp. 204-209.
29. J. Westra and P. Groeneveld, "Is probabilistic congestion estimation worthwhile?" in Proc. SLIP, 2005, pp. 99-106.
30. [Online]. Available: www.ispd.cc/ispd07_contest.html
31. [Online]. Available: www.ece.ucsb.edu/~kastner/labyrinth/
32. [Online]. Available: vlsicad.ucsd.edu/GSRC/bookshelf/Slots/RSMT/ FastSteiner/
33. [Online]. Available: home.eng.iastate.edu/-cnchu/flute.html
34. [Online]. Available: www.cerc.utexas.edu/~thyeros/boxrouter/boxrouter.htm
35. [Online]. Available: www.cerc.utexas.edu/utda/download/BoxRouter.htm
36. [Online]. Available: vlsicad.eecs.umich.edu/BK/FGR/
37. [Online]. Available: www.ispd.cc/ispd07_contest.html