UTACO: a unified timing and congestion optimization algorithm for standard cell global routing

Timing performance and routability are two main goals of global routing. These two targets are mutually conflicting if we view and handle their effects independently. In this paper, we adopt a shadow price mechanism to incorporate the two issues into one unified objective function. We formulate global routing as a multicommodity flow problem. The objective function is the slack of congestion with the clock period as the delay limit from registers and inputs to registers and outputs. The multicommodity flow is expressed by a linear-programming formulation as a primal problem. We then convert the primal problem into a dual formulation using the shadow price as the variables. The shadow price of a net is the sum of its congestion price and timing price. The primal and dual formulation offers theoretical upper and lower bounds of the routing solution. Throughout the optimization process, the difference of the two bounds reduces, which provides the user's insight into the quality of the solutions. Based on the new formulation, this paper presents the UTACO algorithm for standard cell global routing.

[1]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[2]  Yici Cai,et al.  UTACO: a unified timing and congestion optimizing algorithm for standard cell global routing , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

[3]  U. Lauther,et al.  A new global router based on a flow model and linear assignment , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  David G. Luenberger,et al.  Linear and Nonlinear Programming: Second Edition , 2003 .

[5]  Andrew B. Kahng,et al.  International Symposium on Physical Design (ISPD) , 2002, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Jason Cong,et al.  Interconnect layout optimization under higher-order RLC model , 1997, 1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[7]  Milos Hrkic,et al.  Buffer tree synthesis with consideration of temporal locality, sink polarity requirements, solution cost and blockages , 2002, ISPD '02.

[8]  Xianlong Hong,et al.  An Efficient Timing-Driven Global Routing Algorithm , 1993, 30th ACM/IEEE Design Automation Conference.

[9]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Eugene Shragowitz,et al.  A global router based on a multicommodity flow model , 1987, Integr..

[11]  Andrew B. Kahng,et al.  Near-optimal critical sink routing tree constructions , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Jun Gu,et al.  An efficient congestion optimization algorithm for global routing based on search space traversing technology , 2001, ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549).

[13]  Chak-Kuen Wong,et al.  A weighted Steiner tree-based global router with simultaneous length and density minimization , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  J. Cong,et al.  Interconnect design for deep submicron ICs , 1997, ICCAD 1997.

[15]  Yao-Wen Chang,et al.  Timing-driven routing for symmetrical array-based FPGAs , 2000, TODE.

[16]  Chung-Kuan Cheng,et al.  Timing optimization for multisource nets , 1999 .

[17]  Jiang Hu,et al.  Buffer insertion with adaptive blockage avoidance , 2002, ISPD '02.

[18]  Lisa Fleischer,et al.  Fast and simple approximation schemes for generalized flow , 2002, Math. Program..

[19]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[20]  Majid Sarrafzadeh,et al.  An exact algorithm for coupling-free routing , 2001, ISPD '01.

[21]  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..

[22]  Sachin S. Sapatnekar,et al.  A timing-constrained algorithm for simultaneous global routing of multiple nets , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[23]  Jiang Hu,et al.  Simultaneous driver sizing and buffer insertion using a delay penalty estimation technique , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  Ben Ting,et al.  Routing Techniques for Gate Array , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[25]  Chung-Kuan Cheng,et al.  New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing , 1996, DAC '96.

[26]  N. Nettleton,et al.  Dense, performance directed, auto place and route , 1988, Proceedings of the IEEE 1988 Custom Integrated Circuits Conference.

[27]  Yasuyuki Fujihara,et al.  DYNAJUST: An Efficient Automatic Routing Technique Optimizing Delay Conditions , 1989, 26th ACM/IEEE Design Automation Conference.

[28]  Christoph Albrecht,et al.  Provably good global routing by a new approximation algorithm for multicommodity flow , 2000, ISPD '00.

[29]  Jason Cong,et al.  Performance driven global routing for standard cell design , 1997, ISPD '97.

[30]  Jason Cong,et al.  Optimal wiresizing for interconnects with multiple sources , 1995, TODE.

[31]  Brian Bell,et al.  Repeater insertion and wire sizing optimization for throughput-centric VLSI global interconnects , 2002, ICCAD 2002.

[32]  Yici Cai,et al.  An efficient hierarchical timing-driven Steiner tree algorithm for global routing , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[33]  Liang Yin,et al.  An efficient analytical model of coupled on-chip RLC interconnects , 2001, ASP-DAC '01.

[34]  Vishwani D. Agrawal,et al.  Chip Layout Optimization Using Critical Path Weighting , 1984, 21st Design Automation Conference Proceedings.

[35]  Xianlong Hong,et al.  Performance-Driven Steiner Tree Algorithms for Global Routing , 1993, 30th ACM/IEEE Design Automation Conference.

[36]  Soha Hassoun,et al.  Optimal buffered routing path constructions for single and multiple clock domain systems , 2002, ICCAD 2002.

[37]  Sachin S. Sapatnekar,et al.  Non-Hanan routing , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[38]  Robert E. Tarjan,et al.  Algorithms for maximum network flow , 1986 .

[39]  W. C. Elmore.  The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

[40]  T. Sakurai,et al.  Approximation of wiring delay in MOSFET LSI , 1983, IEEE Journal of Solid-State Circuits.

[41]  洪先龙,et al.  SSTT： Efficient Local Search for GSI Global Routing , 2003 .

[42]  Yao-Wen Chang,et al.  A novel framework for multilevel routing considering routability and performance , 2002, ICCAD 2002.

[43]  Sachin S. Sapatnekar,et al.  FAR-DS: full-plane AWE routing with driver sizing , 1999, DAC '99.

[44]  Martin D. F. Wong,et al.  An efficient and optimal algorithm for simultaneous buffer and wire sizing , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[45]  Charlie Chung-Ping Chen,et al.  Optimal wire-sizing formula under the Elmore delay model , 1996, DAC '96.

[46]  Xianlong Hong,et al.  TIGER: an efficient timing-driven global router for gate array and standard cell layout design , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[47]  Dongsheng Wang,et al.  Performance-driven interconnect global routing , 1996, Proceedings of the Sixth Great Lakes Symposium on VLSI.

[48]  Milos Hrkic,et al.  S-Tree: a technique for buffered routing tree synthesis , 2002, DAC '02.