A Timing-Constrained Algorithm for Simultaneous Global Routing of Multiple Nets

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.

• Type: Conference
• Year: 2000
• Where: ICCAD
• Authors: Jiang Hu, Sachin S. Sapatnekar
• Keywords: Delay Model, Global Routing, Hardware, ICCAD 2000, Single-net Routing Algorithm