GRIP: Scalable 3D global routing using integer programming

Proceedings - Design Automation Conference

Volumn , Issue , 2009, Pages 320-325

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

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

Author keywords

Global routing; Integer programming

Indexed keywords

GLOBAL ROUTING; LAYER ASSIGNMENT; WIRE LENGTH;

COMPUTER AIDED DESIGN; DIGITAL INTEGRATED CIRCUITS; DYNAMIC PROGRAMMING; INTERNET PROTOCOLS; LINEARIZATION; ROUTING ALGORITHMS; THREE DIMENSIONAL;

INTEGER PROGRAMMING;

EID: 70350706092     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. ISPD 1998 global routing benchmark suite, 1998.
2. ISPD global routing contest and benchmark suite, 2007.
3. C. Albrecht. Global routing by new approximation algorithms for multicommodityflow. IEEE TCAD, 20(5):622-632, 2001.
4. L. Behjat and A. Chiang. Fast integer linear programming based models for VLSI global routing. In ISCAS (6), pages 6238-6243, 2005.
5. M. Burstein and R. Pelavin. Hierarchical wire routing. IEEE TCAD, 2(4):223-234, 1983.
6. Y.-J. Chang, Y.-T. Lee, and T.-C. Wang. Nthu - route 2.0: A fast and stable global router. In ICCAD, pages 338-343, 2008.
7. H.-Y. Chen, C.-H. Hsu, and Y.-W. Chang. High-performance global routing with fast overflow reduction. In ASPDAC, pages 582-587, 2009.
8. M. Cho, K. Lu, K. Yuan, and D. Z. Pan. Boxrouter 2.0: architecture and implementation of a hybrid and robust global router. In ICCAD, pages 503-508, 2007.
9. C. C. N. Chu and Y.-C. Wong. Flute: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE TCAD, 27(1):70-83, 2008.
10. CPLEX Optimization, Inc., Incline Village, NV. Using the CPLEX Callable Library, Version 9, 2005.
11. G. Dantzig and P. Wolfe. Decomposition principle for linear programs. Operations Research, 8:101-111, 1960.
12. J. Desrosiers and M. E. Lübbecke. A primer in column generation. In G. Desaulniers, J. Desrosiers, and M. M. Solomon, editors, Column Generation, chapter 1. Springer, 2005.
13. E. W. Dijkstra. A note on two problems in connetion with graphs. Numerische Mathematik, 1:269-271.
14. M. R. Garey and D. S. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM Journal of Applied Math, 32:826-834, 1977.
15. J. Hu, J. A. Roy, and I. L. Markov. Sidewinder: a scalable ILP-based router. In SLIP, pages 73-80, 2008.
16. M. J. Litzkow, M. Livny, and M. W. Mutka. Condor - A hunter of idle workstations. In Proceedings of the 8th International Conference on Distributed Computing Systems, pages 104-111, 1998.
17. M. D. Moffitt. Maizerouter: Engineering an effective global router. In ASPDAC, pages 226-231, 2008.
18. M. M. Ozdal and M. D. F. Wong. Archer: a history-driven global routing algorithm. In ICCAD, pages 488-495, 2007.
19. J. A. Roy and I. L. Markov. High-performance routing at the nanometer scale. In ICCAD, pages 496-502, 2007.
20. T. Terlaky, A. Vannelli, and H. Zhang. On routing in VLSI design and communication networks. Discrete Applied Mathematics, 156(11):2178-2194, 2008.
21. Z. Yang, S. Areibi, and A. Vannelli. An ILP based hierarchical global routing approach for VLSI ASIC design. Optimization Letters, pages 281-297, 2007.
22. Y. Zhang, Y. Xu, and C. Chu. Fastroute3: a fast and high quality global router based on virtual capacity. In ICCAD, pages 344-349, 2008.