High-performance global routing with fast overflow reduction

• Published in: 2009 Asia and South Pacific Design Automation Conference pp. 582 - 587
• Main Authors: Huang-Yu Chen, Chin-Hsiung Hsu, Yao-Wen Chang
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.01.2009
• Subjects: Circuit synthesis; Convergence; Costs; Design engineering; History; Integer linear programming; Lagrangian functions; Routing; Runtime; Tiles
• ISBN: 9781424427482; 1424427487
• ISSN: 2153-6961
• DOI: 10.1109/ASPDAC.2009.4796543

Global routing is an important step for physical design. In this paper, we develop a new global router, NTUgr, that contains three major steps: prerouting, initial routing, and enhanced iterative negotiation-based rip-up/rerouting (INR). The prerouting employs a two-stage technique of congestion-hotspot historical cost pre-increment followed by small bounding-box area routing. The initial routing is based on efficient iterative monotonic routing. For traditional INR, it has evolved as the main stream for the state-of-the-art global routers, which reveals its great ability to reduce the congestion and overflow. As pointed out by recent works, however, traditional INR may get stuck at local optima as the number of iterations increases. To remedy this deficiency, we replace INR by enhanced iterative forbidden-region rip-up/rerouting (IFR) which features three new techniques of (1) multiple forbidden regions expansion, (2) critical subnet rerouting selection, and (3) look-ahead historical cost increment. Experimental results show that NTUgr achieves high-quality results for the ISPD'07 and ISPD'08 benchmarks for both overflow and runtime.