Cost-radius balanced spanning/Steiner trees

The most crucial factor that degrades a high speed VLSI is the signal propagation delay in a routing tree. It is estimated additively by the amount of the source-to-sink path length and total length. To design a routing tree in which these two are balancingly small, we propose an algorithm to construct a spanning tree, by which a tree is constructed in a hybrid way of the Minimum-Tree and Shortest-Path Tree algorithms. The idea is extended to finding such a rectilinear Steiner tree. Experiments are given to show how the source-to-sink path length and total length are balanced and small.

[1]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[2]  David R. Karger,et al.  Prim-Dijkstra tradeoffs for improved performance-driven routing tree design , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[4]  Chak-Kuen Wong,et al.  New algorithms for the rectilinear Steiner tree problem , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Samir Khuller,et al.  Balancing minimum spanning and shortest path trees , 1993, SODA '93.

[6]  Massoud Pedram,et al.  Constructing minimal spanning/Steiner trees with bounded path length , 1996, Proceedings ED&TC European Design and Test Conference.

[7]  D. T. Lee,et al.  Bounded diameter minimum spanning trees and related problems , 1989, SCG '89.

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

[9]  Jason Cong,et al.  Provably good performance-driven global routing , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Samir Khuller,et al.  Balancing Minimum Spanning and Shortest Path Trees , 1993, SODA.

[11]  David S. Johnson,et al.  The Rectilinear Steiner Problem is NP-Complete , 1977 .

[12]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .