Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption

We propose the first theoretical approach to global routing that takes coupling between adjacent wires, bounds on delays along critical paths, and overall capacitance (power consumption) into account. It consists of an efficient combinatorial fully polynomial approximation scheme to a fractional relaxation, followed by randomized rounding. The overall deviation from the optimum can be bounded. The model could also be used for routing traffic flows with congestion-dependent travel times.

[1]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[2]  Prabhakar Raghavan,et al.  Multiterminal global routing: A deterministic approximation scheme , 2005, Algorithmica.

[3]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[4]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Prabhakar Raghavan.  Randomized Rounding And Discrete Ham-Sandwich Theorems: , 1986 .

[6]  Chung-Kuan Cheng,et al.  A global router with a theoretical bound on the optimal solution , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Sachin S. Sapatnekar,et al.  A survey on multi-net global routing for integrated circuits , 2001, Integr..

[8]  Leonid Khachiyan,et al.  Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..

[9]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[10]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[11]  Richard M. Karp,et al.  Global wire routing in two-dimensional arrays , 1987, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[12]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[13]  Yici Cai,et al.  A novel timing-driven global routing algorithm considering coupling effects for high performance circuit design , 2003, ASP-DAC '03.

[14]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[15]  Aravind Srinivasan,et al.  New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.

[16]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[17]  Christoph Albrecht,et al.  Global routing by new approximation algorithms for multicommodityflow , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[19]  Jens Vygen,et al.  Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip 3 , 2001 .

[20]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[21]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[22]  Leonid Khachiyan,et al.  Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[23]  Yici Cai,et al.  UTACO: a unified timing and congestion optimization algorithm for standard cell global routing , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.