GRIP: Global Routing via Integer Programming

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

Volumn 30, Issue 1, 2011, Pages 72-84

  Wu, Tai Hsuan ^a   Davoodi, Azadeh ^a   Linderoth, Jeffrey T ^a  

^a Wisconsin Electric Machines and Power Electronics Consortium   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; LINEAR PROGRAMMING;

GLOBAL ROUTING; HIGH-QUALITY SOLUTIONS; LAYER ASSIGNMENT; METAL LAYER; SECOND-PHASE; SUB-PROBLEMS; WIRE LENGTH;

INTEGER PROGRAMMING;

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

References (32)

1. ISPD 1998 Global Routing Benchmark Suite. (1998) [Online]. Available: http://cseweb.ucsd.edu/ kastner/research/labyrinth/
2. ISPD Global Routing Contest and Benchmark Suite. (2007) [Online]. Available: http://www.sigda.org/ISPD2007/rcontest/
3. ISPD Global Routing Contest and Benchmark Suite. (2008) [Online]. Available: http://www.sigda.org/ISPD2008/contests/ISPD08rc.html
4. C. Albrecht, "Global routing by new approximation algorithms for multicommodity flow," IEEE Trans. Comput.-Aided Integr. Circuits Syst., vol. 20, no. 5, pp. 622-632, May 2001. (Pubitemid 32518574)
5. C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, "Branch-and-price: Column generation for solving huge integer programs," Oper. Res., vol. 46, no. 3, pp. 316-329, 1998. (Pubitemid 128655433)
6. L. Behjat, A. Vannelli, and W. Rosehart, "Integer linear programming models for global routing," INFORMS J. Comput., vol. 18, no. 2, pp. 137-150, 2006. (Pubitemid 44000299)
7. M. Burstein and R. Pelavin, "Hierarchical wire routing," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 2, no. 4, pp. 223-234, Apr. 1983. (Pubitemid 14486457)
8. Y.-J. Chang, Y.-T. Lee, and T.-C. Wang, "NTHU - Route 2.0: A fast and stable global router," in Proc. IEEE Int. Conf. Comput.-Aided Design, 2008, pp. 338-343.
9. H.-Y. Chen, C.-H. Hsu, and Y.-W. Chang, "High-performance global routing with fast overflow reduction," in Proc. IEEE Asia South Pacific Design Autom. Conf., 2009, pp. 582-587.
10. M. Cho, K. Lu, K. Yuan, and D. Z. Pan, "BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability," ACM Trans. Design Autom. Electr. Syst., vol. 14, no. 2, article 32, Mar. 2009.
11. C. C. N. Chu and Y.-C. Wong, "Flute: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 27, no. 1, pp. 70-83, Jan. 2008. (Pubitemid 350281168)
12. Using the CPLEX Callable Library, Version 9, CPLEX Optimization, Inc., Incline Village, NV, 2005.
13. G. Dantzig and P. Wolfe, "Decomposition principle for linear programs," Oper. Res., vol. 8, no. 1, pp. 101-111, 1960.
14. J. Desrosiers and M. E. Lübbecke, "A primer in column generation," in Column Generation, G. Desaulniers, J. Desrosiers, and M. M. Solomon, Eds. Berlin, Germany: Springer, 2005, ch. 1.
15. E. W. Dijkstra, "A note on two problems in connection with graphs," Numer. Math., vol. 1, pp. 269-271, 1959.
16. M. R. Garey and D. S. Johnson, "The rectilinear Steiner tree problem is NP-complete," SIAM J. Appl. Math., vol. 32, pp. 826-834, 1977.
17. J. Hu, J. A. Roy, and I. L. Markov, "Sidewinder: A scalable ILP-based router," in Proc. ACM Int. Workshop Syst. Level Interconnect Prediction, 2008, pp. 73-80.
18. T. C. Hu and M. T. Shing, "A decomposition algorithm for circuit routing," in Mathematical Programming Essays in Honor of George B. Dantzig Part I, vol. 24. Berlin, Germany: Springer, pp. 87-103.
19. D. G. Jogensen and M. Meyling, "A branch-and-price algorithm for switch-box routing," Networks, vol. 40, no. 1, pp. 13-26, 2002.
20. T.-H. Lee and T.-C. Wang, "Congestion-constrained layer assignment for via minimization in global routing," IEEE Trans. Comput-Aided Design Integr. Circuits Syst., vol. 27, no. 9, pp. 1643-1656, Sep. 2008.
21. M. J. Litzkow, M. Livny, and M. W. Mutka, "Condor: A hunter of idle workstations," in Proc. 8th Int. Conf. Distributed Comput. Syst., 1998, pp. 104-111.
22. L. McMurchie and C. Ebeling, "Pathfinder: A negotiation-based performance-driven router for FPGAs," in Proc. FPGA, 1995, pp. 111-117.
23. M. D. Moffitt, "Maizerouter: Engineering an effective global router," IEEE Trans. Comput-Aided Design Integr. Circuits Syst., vol. 27, no. 11, pp. 2017-2026, Nov. 2008.
24. The MOSEK C API Manual, Version 5.0, MOSEK ApS, Copenhagen, Denmark, 2008.
25. D. Müller, "Optimizing yield in global routing," in Proc. IEEE Int. Conf. Comput.-Aided Design, Nov. 2006, pp. 480-486.
26. M. M. Ozdal and M. D. F. Wong, "Archer: A history-based global routing algorithm," IEEE Trans. Comput-Aided Design Integr. Circuits Syst., vol. 28, no. 4, pp. 528-540, Apr. 2009.
27. M. Pan and C. C. N. Chu, "Fastroute 2.0: A high-quality and efficient global router," in Proc. IEEE Asia South Pacific Des. Autom. Conf., 2007, pp. 250-255.
28. J. A. Roy and I. L. Markov, "High-performance routing at the nanometer scale," IEEE Trans. Comput-Aided Design Integr. Circuits Syst., vol. 27, no. 6, pp. 1066-1077, Jun. 2008.
29. T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Dis. Appl. Math., vol. 156, no. 11, pp. 2178-2194, 2008.
30. T.-H. Wu, A. Davoodi, and J. Linderoth, "GRIP: Scalable 3-D global routing using integer programming," in Proc. IEEE Des. Autom. Conf., 2009, pp. 320-325.
31. Y. Xu, Y. Zhang, and C. Chu, "FastRoute 4.0: Global router with efficient via minimization," in Proc. IEEE Asia South Pacific Des. Autom. Conf., 2009, pp. 576-581.
32. Z. Yang, A. Vannelli, and S. Areibi, "An ILP based hierarchical global routing approach for VLSI ASIC design," Optimization Lett., vol. 1, no. 3, pp. 281-297, 2007. (Pubitemid 46781988)