Buffered Steiner tree construction with wire sizing for interconnect layout optimization

This paper presents an efficient algorithm for buffered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm finds a Steiner tree with buffer insertion and wire sizing so that the required arrival time (or timing slack) at the source is maximized. The unique contribution of our algorithm is that it performs Steiner tree construction, buffer insertion, and wire sizing simultaneously with consideration of both critical delay and total capacitance minimization by combining the performance-driven A-tree construction and dynamic programming based buffer insertion and wire sizing, while tree construction and the other delay minimization techniques were carried out independently in the past. Experimental results show the effectiveness of our approach.

[1]  Jason Cong,et al.  Simultaneous Driver And Wire Sizing For Performance And Power Optimization* , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[2]  Jason Cong,et al.  Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion , 1996 .

[3]  Hyunchul Shin,et al.  Performance-oriented technology mapping for LUT-based FPGA's , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[4]  Chung-Kuan Cheng,et al.  Optimal wire sizing and buffer insertion for low power and a generalized delay model , 1996 .

[5]  C. Leonard Berman,et al.  The fanout problem: from theory to practice , 1989 .

[6]  Peter Suaris,et al.  A Methodology and Algorithms for Post-Placement Delay Optimization , 1994, 31st Design Automation Conference.

[7]  Jason Cong,et al.  Performance-Driven Interconnect Design Based on Distributed RC Delay Model , 1993, 30th ACM/IEEE Design Automation Conference.

[8]  Chung-Kuan Cheng,et al.  Simultaneous routing and buffer insertion for high performance interconnect , 1996, Proceedings of the Sixth Great Lakes Symposium on VLSI.

[9]  Frank K. Hwang,et al.  The rectilinear steiner arborescence problem , 2005, Algorithmica.

[10]  Sung-Mo Kang,et al.  Interconnection delay in very high-speed VLSI , 1991 .

[11]  Sachin S. Sapatnekar,et al.  RC Interconnect Optimization under the Elmore Delay Model , 1994, 31st Design Automation Conference.

[12]  Mark Horowitz,et al.  Signal Delay in RC Tree Networks , 1983, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  A. Kahng,et al.  On optimal interconnections for VLSI , 1994 .

[14]  Ernest S. Kuh,et al.  Post routing performance optimization via multi-link insertion and non-uniform wiresizing , 1995, ICCAD.

[15]  Gabriel Robins,et al.  Dynamically-wiresized Elmore-based routing constructions , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

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

[17]  J. Cong,et al.  Optimal wiresizing under the distributed Elmore delay model , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).