SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Datapath routing based on a decongestion metric
ISPD '00 Proceedings of the 2000 international symposium on Physical design
A timing-constrained algorithm for simultaneous global routing of multiple nets
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Multilevel approach to full-chip gridless routing
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
An enhanced multilevel routing system
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
SSTT: efficient local search for GSI global routing
Journal of Computer Science and Technology
True crosstalk aware incremental placement with noise map
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
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
Optimizing yield in global routing
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
The coming of age of (academic) global routing
Proceedings of the 2008 international symposium on Physical design
MaizeRouter: engineering an effective global router
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
A new global router for modern designs
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Energy and switch area optimizations for FPGA global routing architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
BonnRoute: Algorithms and data structures for fast and good VLSI routing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.03 |
The global routing problem is formulated as a multiterminal, multicommodity flow problem with integer flows, An E-optimal 2-terminal multicommodity flow algorithm with fractional flows is extended to handle multiterminal commodities, Our adaptation of this network flow algorithm seeks to maximize overall routability by minimizing edge congestion as opposed to conventional techniques which usually seek to minimize wire length. We show that under certain conditions, our approach derives an approximate optimal solution. We apply a randomized rounding procedure to derive an integer solution from the fractional multicommodity flow solution. Experimental results demonstrate that this network flow algorithm can be realistically used to route industrial sized circuits with reduced congestion