Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An efficient timing-driven global routing algorithm
DAC '93 Proceedings of the 30th international Design Automation Conference
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Interconnect layout optimization under higher-order RLC model
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Performance driven global routing for standard cell design
Proceedings of the 1997 international symposium on Physical design
FAR-DS: full-plane AWE routing with driver sizing
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Faster approximation algorithms for generalized flow
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Timing-Driven Routing for Symmetrical-Array-Based FPGAs
ICCD '98 Proceedings of the International Conference on Computer Design
Performance-Driven Interconnect Global Routing
GLSVLSI '96 Proceedings of the 6th Great Lakes Symposium on VLSI
Near-optimal critical sink routing tree constructions
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A global router with a theoretical bound on the optimal solution
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Creating and exploiting flexibility in steiner trees
Proceedings of the 38th annual Design Automation Conference
Congestion-driven codesign of power and signal networks
Proceedings of the 39th annual Design Automation Conference
Full-Chip Multilevel Routing for Power and Signal Integrity
Proceedings of the conference on Design, automation and test in Europe - Volume 2
CNB: a critical-network-based timing optimization method for standard cell global routing
Journal of Computer Science and Technology
Equidistance routing in high-speed VLSI layout design
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Equidistance routing in high-speed VLSI layout design
Integration, the VLSI Journal - Special issue: ACM great lakes symposium on VLSI
UTACO: a unified timing and congestion optimizing algorithm for standard cell global routing
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
A routing algorithm for flip-chip design
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
BoxRouter: a new global router based on box expansion and progressive ILP
Proceedings of the 43rd annual Design Automation Conference
Integration, the VLSI Journal
Full-chip multilevel routing for power and signal integrity
Integration, the VLSI Journal
Wire density driven global routing for CMP variation and timing
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
BoxRouter 2.0: architecture and implementation of a hybrid and robust global router
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
ACM Transactions on Design Automation of Electronic Systems (TODAES)
BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Timing-driven non-rectangular obstacles-avoiding routing algorithm for the X-architecture
IMCAS'09 Proceedings of the 8th WSEAS international conference on Instrumentation, measurement, circuits and systems
WSEAS Transactions on Circuits and Systems
Equidistance routing in high-speed VLSI layout design
Integration, the VLSI Journal - Special issue: ACM great lakes symposium on VLSI
A power-efficient multipin ILP-based routing technique
IEEE Transactions on Circuits and Systems Part I: Regular Papers
X-architecture obstacles-avoiding routing with ECO consideration
ICC'10 Proceedings of the 14th WSEAS international conference on Circuits
ECO-aware obstacle-avoiding routing tree algorithm
WSEAS Transactions on Circuits and Systems
Hi-index | 0.00 |
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provides a general framework that may use any single-net routing algorithm and any delay model in global routing. It is based on the observation that there are several routing topology flexibilities under timing constraints. These flexibilities are exploited for congestion reduction through a network flow based hierarchical bisection and assignment process. Experimental results on benchmark circuits are quite promising.