An efficient algorithm for buffered routing tree construction under fixed buffer locations with accurate delay models

This paper studies the problem of buffered routing tree construction under fixed buffer locations with accurate delay models. In our approach, we firstly construct a timing-driven and buffer-aware Steiner tree, based on which each furcation buffer is searched in a bounding box. Then, a buffered routing tree is constructed by a dynamic programming method from the bottom up. The experimental results show that our algorithm performs well.

[1]  Chris Chu,et al.  An efficient routing tree construction algorithm with buffer insertion, wire sizing and obstacle considerations , 2004 .

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

[3]  Li-Da Huang,et al.  Maze routing with buffer insertion under transition time constraints , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[4]  Jason Cong,et al.  Routing tree construction under fixed buffer locations , 2000, Proceedings 37th Design Automation Conference.

[5]  Mark A. Franklin,et al.  Optimum buffer circuits for driving long uniform lines , 1991 .

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

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

[8]  Martin D. F. Wong,et al.  Closed form solution to simultaneous buffer insertion/sizing and wire sizing , 1997, ISPD '97.

[9]  L.P.P.P. van Ginneken,et al.  Buffer placement in distributed RC-tree networks for minimal Elmore delay , 1990, IEEE International Symposium on Circuits and Systems.