Wen-Hao Liu
Yaoguang Wei
Cliff Sze
Charles J. Alpert
Zhuo Li
ABSTRACT
To address the routability issue, routing congestion estimators (RCE) become essential in industrial design flow. Recently, several RCEs [1-4] based on global routing engines are developed, but they typically ignore the effects of routing on timing so that the identified routing paths may be overlong and thus impractical. To be aware of the timing issues, our proposed global-routing-based RCE obeys the layer directive and scenic constraints to respectively limit the routing layers and the maximum routing wirelength of the potentially timing-critical nets. To handle the scenic constrains, we propose a novel method based on a relaxation-legalization scheme. Also, because the work in [5] reveals that congestion ratio is a better indicator than overflow to evaluate routability, this work focuses on minimizing the congestion ratio rather than overflows. As will be shown, the problem of minimizing congestion ratio is more complicated than minimizing overflows, so we develop a new rip-up and rerouting scheme to reduce congestion and further to approach a target congestion ratio. Moreover, to fit the demands of practical uses, this work presents a control utility to trade off runtime and quality, which is an essential function to an industrial RCE tool. Experiments reveal that the proposed RCE is faster and more accurate than another industrial global-routing-based RCE.
- J. Hu et al, "Completing high-quality global routes," in Proc. ISPD, pp. 35--41, 2010. Google Scholar
Digital Library
- W.-H. Liu et al., "Multi-threaded collision-aware global routing with bounded-length maze routing," in Proc. DAC, pp. 200--205, 2010. Google ScholarDigital Library
- W.-H. Liu et al., "A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing," in Proc. ICCAD, pp. 713--719, 2012. Google ScholarDigital Library
- H. Shojaei et al., "Congestion analysis for global routing via integer programming," in Proc. ICCAD, pp. 256--262, 2011. Google ScholarDigital Library
- Y. Wei et al., "GLARE: global and local wiring aware routability evaluation," in Proc. DAC, pp. 768--773, 2012. Google ScholarDigital Library
- J. Lou et al., "Estimating routing congestion using probabilistic analysis," IEEE TCAD, 21(1), pp. 32--41, 2002. Google ScholarDigital Library
- J. Westra et al., "Probabilistic congestion prediction", in Proc. ISPD, pp. 204--209, 2004. Google ScholarDigital Library
- M. D. Moffitt, "Global routing revisited," in Proc. ICCAD, pp. 805--808, 2009. Google ScholarDigital Library
- Y.-J. Chang et al., "GLADE: A modern global router considering layer directives," in Proc. ICCAD, pp.319--323, 2010. Google ScholarDigital Library
- T.-H. Lee et al., "An enhanced global router with consideration of general layer directives," in Proc. ISPD, pp.53--60, 2011. Google ScholarDigital Library
- M. D. Moffitt and C. N. Sze, "Wire synthesizable global routing for timing closure," in Proc. ASP-DAC, pp. 545--550, 2011. Google ScholarDigital Library
- Y. Wei et al., "CATALYST: planning layer directives for effective design closure," in Proc. DATE, pp. 1873--1878, 2013. Google ScholarDigital Library
- C. Chu and Y.-C. Wong, "FLUTE: fast lookup table based rectilinear steiner minimal tree algorithm for VLSI design," IEEE TCAD, 27(1), pp. 70--83, 2008. Google ScholarDigital Library
- Hai Zhou et al., "Efficient minimum spanning tree construction without Delaunay triangulation," Information Processing Letter, pp. 271--276, 2002. Google ScholarDigital Library
- K.-R. Dai et al., "NCTU-GR: efficient simulated evolution-based rerouting and congestion-relaxed layer assignment on 3-D global routing", IEEE TVLSI, 20(3), pp. 459--472, 2012. Google ScholarDigital Library
- M. D. Moffitt, "MaizeRouter: engineering an effective global router," IEEE TCAD, 27(11), pp. 2017--2026, 2008. Google ScholarDigital Library
- W.-H. Liu et al., "Case study for placement solutions in ISPD11 and DAC12 routability-driven placement contests," in Proc. ISPD, to appear, 2013. Google ScholarDigital Library
Index Terms
- Routing congestion estimation with real design constraints
Recommendations
ISPD 2015 Benchmarks with Fence Regions and Routing Blockages for Detailed-Routing-Driven Placement
ISPD '15: Proceedings of the 2015 Symposium on International Symposium on Physical DesignThe ISPD~2015 placement-contest benchmarks include all the detailed pin, cell, and wire geometry constraints from the 2014 release, plus
(a) added fence regions and placement blockages,
(b) altered netlists including fixed macro blocks,
(c) reduced ...
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 ...
Region-Based and Panel-Based Algorithms for Unroutable Placement Recognition
To avoid producing unroutable placement solutions, many state-of-the-art routability-driven placers iteratively invoke global routers to evaluate their placement solutions, and then perform routability optimization. However, using a global router to ...
Comments