Exploring high-throughput computing paradigm for global routing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 22, Issue 1, 2014, Pages 155-167

  Han, Yiding ^a   Ancajas, Dean Michael ^a   Chakraborty, Koushik ^a   Roy, Sanghamitra ^a  

^a Utah State University   (United States)

Author keywords

Global routing; graphics processing unit; high throughput computing

Indexed keywords

COMPUTATIONAL PROBLEM; DATA DEPENDENCIES; DATA-LEVEL PARALLELISM; GLOBAL ROUTING; GRAPHICS PROCESSING UNIT; GRAPHICS PROCESSING UNITS; HIGH-THROUGHPUT COMPUTING; TECHNOLOGY SCALING;

ALGORITHMS; COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; COMPUTER SIMULATION; HARDWARE; SCHEDULING;

PROGRAM PROCESSORS;

EID: 84891829337     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2012.2234489     Document Type: Article

References (32)

1. D. Cross, E. Nequist, and L. Scheffer, A DFM aware, space based router, in Proc. Int. Symp. Phys. Design, 2007, pp. 171-172.
2. N. Kaul, Design planning trends and challenges, in Proc. Int. Symp. Phys. Design, 2010, p. 5.
3. C. J. Alpert, Z. Li, M. D. Moffitt, G.-J. Nam, J. A. Roy, and G. Tellez, What makes a design difficult to route, in Proc. Int. Symp. Phys. Design, 2010, pp. 7-12.
4. R. C. Johnson, IBM warns of 'design rule explosion' beyond 22-nm, EE Times, Mar. 2010.
5. P. Groeneveld, Going with the flow: Bridging the gap between theory and practice in physical design, in Proc. Int. Symp. Phys. Design, 2010, p. 3.
6. M. D. Moffitt, J. A. Roy, and I. L. Markov, The coming of age of (academic) global routing, in Proc. Int. Symp. Phys. Design, 2008, pp. 148-155.
7. J. Croix and S. Khatri, Introduction to GPU programming for EDA, in Proc. IEEE Int. Conf. Comput.-Aided Design, Nov. 2009, pp. 276-280.
8. K. Gulati and S. Khatri, Toward acceleration of fault simulation using graphics processing units, in Proc. Design Autom. Conf., Jun. 2008, pp. 822-827.
9. K. Gulati and S. P. Khatri, Accelerating statistical static timing analysis using graphics processing units, in Proc. Asia-Pacific Design Autom. Conf., 2009, pp. 260-265.
10. W.-H. Liu, W.-C. Kao, Y.-L. Li, and K.-Y. Chao, Multi-threaded collision-aware global routing with bounded-length maze routing, in Proc. Design Autom. Conf., 2010, pp. 200-205.
11. T.-H. Wu, A. Davoodi, and J. T. Linderoth, A parallel integer programming approach to global routing, in Proc. Design Autom. Conf., 2010, pp. 194-199.
12. L. McMurchie and C. Ebeling, PathFinder: A negotiation-based performance-driven router for FPGAs, in Proc. ACM 3rd Int. Symp. Field-Program. Gate Arrays, Feb. 1995, pp. 111-117.
13. 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.
14. Y.-J. Chang, Y.-T. Lee, J.-R. Gao, P.-C. Wu, and T.-C. Wang, NTHU-route 2.0: A robust global router for modern designs, IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 29, no. 12, pp. 1931-1944, Dec. 2010.
15. K.-R. Dai, W.-H. Liu, and Y.-L. Li, Efficient simulated evolution based rerouting and congestion-relaxed layer assignment on 3-D global routing, in Proc. Asia-Pacific Design Autom. Conf., 2009, pp. 582-587.
16. H.-Y. Chen, C.-H. Hsu, and Y.-W. Chang, High-performance global routing with fast overflow reduction, in Proc. Asia-Pacific Design Autom. Conf., 2009, pp. 570-575.
17. M. M. Ozdal and M. D. F. Wong, Archer: A history-driven global routing algorithm, in Proc. IEEE Int. Conf. Comput.-Aided Design, San Jose, CA, Nov. 2007, pp. 488-495.
18. 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. IEEE Int. Conf. Comput.-Aided Design, Aug. 2007, pp. 503-508.
19. B. Korte, D. Rautenbach, and J. Vygen, BonnTools: Mathematical innovation for layout and timing closure of systems on a chip, Proc. IEEE, vol. 95, no. 3, pp. 555-572, Mar. 2007.
20. T.-H. Wu, A. Davoodi, and J. T. Linderoth, GRIP: Scalable 3D global routing using integer programming, IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 30, no. 1, pp. 72-84, Jan. 2011.
21. L. Seiler, D. Carmean, E. Sprangle, T. Forsyth, M. Abrash, P. Dubey, S. Junkins, A. Lake, J. Sugerman, R. Cavin, R. Espasa, E. Grochowski, T. Juan, and P. Hanrahan, Larrabee: A many-core x86 architecture for visual computing, ACM Trans. Graph., vol. 27, pp. 18:1-18:15, Aug. 2008.
22. 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.
23. Y. Xu, Y. Zhang, and C. Chu, FastRoute 4.0: Global router with efficient via minimization, in Proc. Asia South Pacific Design Autom. Conf., 2009, pp. 576-581.
24. C. J. Alpert and G. E. Tellez, The importance of routing congestion analysis, in Proc. Design Autom. Conf., 2010, pp. 1-14.
25. C. 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.
26. M. Pan and C. Chu, FastRoute: A step to integrate global routing into placement, in Proc. IEEE Int. Conf. Comput.-Aided Design, Aug. 2006, pp. 464-471.
27. 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, 2001.
28. S. Khanna, S. Gao, and K. Thulasiraman, Parallel hierarchical global routing for general cell layout, in Proc. 5th Great Lakes Symp. VLSI, Washington, DC, 1995, pp. 212-215.
29. Y. Han, D. M. Ancajas, K. Chakraborty, and S. Roy, Exploring high throughput computing paradigm for global routing, in Proc. IEEE Int. Conf. Comput.-Aided Design, Mar. 2011, pp. 298-305.
30. I.-L. Yen, R. Dubash, and F. Bastani, Strategies for mapping Lee's maze routing algorithm onto parallel architectures, in Proc. 7th Int. Parallel Process. Symp., Apr. 1993, pp. 672-679.
31. P. Harish and P. Narayanan, Accelerating large graph algorithms on the GPU using CUDA, in Proc. High Perform. Comput., 2007, pp. 197-208.
32. L. Luo, M. Wong, and W. M. Hwu, An effective GPU implementation of breadth-first search, in Proc. Design Autom. Conf., Anaheim, CA, Jun. 2010, pp. 52-55.