Linear required-arrival-time trees and their construction

Interconnects are dominating VLSI circuit design in deep sub-micron regime. Construction of global routing trees based on required arrival times (RAT) has gained importance over the traditional problem of finding minimum-cost trees. Moreover, recent investigations on the fidelity of delay estimators indicate that the RAT trees with Manhattan distance delay, known as linear RAT trees, are likely to be a viable alternative to buffered trees with Elmore delay model. This paper introduces the linear RAT trees, discusses some related analysis, and proposes a heuristic method for constructing such trees.

[1]  Mary Jane Irwin,et al.  An edge-based heuristic for Steiner routing , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Jason Cong,et al.  Performance optimization of VLSI interconnect layout , 1996, Integr..

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

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

[5]  Jason Cong,et al.  Buffered Steiner tree construction with wire sizing for interconnect layout optimization , 1996, Proceedings of International Conference on Computer Aided Design.

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

[7]  Parthasarathi Dasgupta,et al.  Revisiting VLSI interconnects in deep sub-micron: some open questions , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[8]  Majid Sarrafzadeh,et al.  An Introduction To VLSI Physical Design , 1996 .

[9]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Andrew B. Kahng,et al.  Fidelity and near-optimality of Elmore-based routing constructions , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .