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]  Yao-Wen Chang,et al.  A novel framework for multilevel routing considering routability and performance , 2002, ICCAD 2002.

[2]  Chung-Kuan Cheng,et al.  Timing optimization for multisource nets: characterization andoptimal repeater insertion , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[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]  W. C. Elmore.  The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

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

[25]  Yici Cai,et al.  An efficient hierarchical timing-driven Steiner tree algorithm for global routing , 2003, Integr..

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

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

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

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

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

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