A global interconnect optimization algorithm under accurate delay model using solution space smoothing

Buffer insertion plays a great role in modern global interconnect optimization, while too many buffers may exhaust routing resources, and result in the rise of power dissipation. In this paper, we introduce solution space smoothing technique to construct routing trees under accurate delay models with consideration of buffer/wire sizing and routing obstacles simultaneously. Experimental result shows, compared with the previous Fast-RTBW algorithm which uses simulated annealing under Elmore delay, our algorithm gives comparable routing tree solutions with about 61% of the total buffer areas that Fast-RTBW uses, and the running time is 5-30 times faster than that of Fast-RTBW.

[1]  Chris C. N. Chu,et al.  An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Mattan Kamon,et al.  A coordinate-transformed Arnoldi algorithm for generating guaranteed stable reduced-order models of RLC circuits , 1999 .

[3]  Martin D. F. Wong,et al.  A graph based algorithm for optimal buffer insertion under accurate delay models , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

[4]  Jinan Lou,et al.  A simultaneous routing tree construction and fanout optimization algorithm , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[5]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[6]  L.P.P.P. van Ginneken,et al.  Buffer placement in distributed RC-tree networks for minimal Elmore delay , 1990 .

[7]  Martin D. F. Wong,et al.  A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[8]  Jun Gu,et al.  Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP) , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[9]  Lawrence T. Pileggi,et al.  Modeling the "Effective capacitance" for the RC interconnect of CMOS gates , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[11]  P.R. O'Brien,et al.  Modeling the driving-point characteristic of resistive interconnect for accurate delay estimation , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[12]  Stephen T. Quay,et al.  Buffer insertion with accurate gate and interconnect delay computation , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).