Jin Hu
Igor L. Markov
ABSTRACT
We propose Sidewinder, a new global router that combines pattern routing and maze routing in a novel, incremental, ILP formulation. It is the first flat ILP-based approach scalable enough to consider over 104 GCells at once. Moreover, it also can be used as a component in previously proposed multi-level and progressive ILP schemes. Sidewinder is particularly good at finding routes with minimal via count, which can improve yield in sub-90nm technologies. Other innovations in our work include an ILP construction based on a dynamically-updated congestion map and the use ofC-shape routes to alleviate local congestion and improve routability. On well-known benchmarks, Sidewinder improves routed wirelength and reduces via count by over 6% compared to ILP-based BoxRouter 1.0 and 35.8% compared to DLM-based FGR 1.0. This easy-to-implement methodology is extensible to detail routing of ASICs as well as FPGAs where it can account for complex design rules and models.
- C. Albrecht, "Global Routing by New Approximations for Multicommodity Flow," IEEE TCAD 20(5), pp. 622--632, 2001. Google Scholar
Digital Library
- M. Burstein and R. Pelavin, "Hierarchical Wire Routing,", IEEE TCAD 2(4), pp. 223--234, 1983.Google ScholarDigital Library
- M. Cho and D. Z. Pan, "BoxRouter: A New Global Router Based on Box Expansion and Progressive ILP," In Proc. DAC, pp. 373--378, 2006. Google ScholarDigital Library
- M. Cho, H. Xiang, R. Puri and D. Z. Pan, "Wire Density Driven Global Routing for CMP Variation and Timing," In Proc. ICCAD, pp. 487--492, 2006. Google ScholarDigital Library
- C. C. N. Chu and Y.-C.Wong, "Fast and Accurate Rectilinear Steiner Minimal Tree Algorithm for VLSI Design," In Proc. ISPD, pp. 28--35, 2005. Google ScholarDigital Library
- T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. Section 24.3: Dijkstra's algorithm, pp. 595--601. Google ScholarDigital Library
- R. Hadsell and P. H. Madden, "Improved Global Routing through Congestion Estimation," In DAC, pp. 28--34, 2003. Google ScholarDigital Library
- J. Hu and S. S. Sapatnekar, "A Survey on Multi-net Global Routing for Integrated Circuits," Integration, the VLSI Journal 31(1), pp. 1--49, 2001.Google ScholarCross Ref
- ILOG CPLEX: High-performance software for mathematical programming and optimization. http://www.ilog.com/products/cplexGoogle Scholar
- ISPD 1998 Global Routing benchmark suite. http://www.ece.ucsb.edu/~kastner/labyrinthGoogle Scholar
- ISPD 2007 Global Routing Contest and benchmark suite. http://www.ispd.cc/ispd07_contest.htmlGoogle Scholar
- R. Karp, "Complexity of computer computations", In Reducibility Among Combinatorial Problems, New York: Plenum, 1972.Google ScholarCross Ref
- R. Kastner, E. Bozorgzadeh and M. Sarrafzadeh, "Pattern Routing: Use and Theory for Increasing Predictability and Avoiding Coupling," IEEE TCAD 21(7), pp. 777--790, 2002. Google ScholarDigital Library
- G. Nam, F. Aloul, K. Sakallah and R. Rutenbar, "A comparative study of two Boolean formulations of FPGA detailed routing constraints", In Proc. ISPD, pp. 222--227, 2001. Google ScholarDigital Library
- M. Pan and C. Chu, "FastRoute: A Step to Integrate Global Routing into Placement," In Proc. ICCAD, pp. 464--471, 2006. Google ScholarDigital Library
- M. Pan and C. Chu, "FastRoute 2.0: A High-quality and Efficient Global Router," In Proc. ASP-DAC, pp. 250--255, 2007. Google ScholarDigital Library
- J. Roy and I. Markov, "High-performance Routing at the Nanometer Scale," In Proc. ICCAD, 2007. Google ScholarDigital Library
- TSMC: Silicon Success http://www.tsmc.com/download/enliterature/html-newsletter/September03/InDepth/index.html.Google Scholar
- J. Westra, C. Bartels and P. Groeneveld, "Probabilistic Congestion Prediction," In Proc. ISPD, pp. 204--209, 2004. Google ScholarDigital Library
- H. Xu, R. Rutenbar and K. Sakallah, "sub-SAT: A Formulation for Relaxed Boolean Satisfiability with Applications in Routing," In Proc. ISPD, pp. 182--187, 2002. Google ScholarDigital Library
Index Terms
- Sidewinder: a scalable ILP-based router
Recommendations
BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability
In this article, we present BoxRouter 2.0, and discuss its architecture and implementation. As high-performance VLSI design becomes more interconnect-dominant, efficient congestion elimination in global routing is in greater demand. Hence, we propose a ...
XGRouter: high-quality global router in X-architecture with particle swarm optimization
This paper presents a high-quality very large scale integration (VLSI) global router in X-architecture, called XGRouter, that heavily relies on integer linear programming (ILP) techniques, partition strategy and particle swarm optimization (PSO). A new ...
Area-I/O flip-chip routing for chip-package co-design considering signal skews
The area-input/output (I/O) flip-chip package provides a high chip-density solution to the demand of more I/Os in very large scale integration designs; it can achieve smaller package size, shorter wirelength, and better signal and power integrity. In ...
Comments