论文信息 - The repeater tree construction problem

The repeater tree construction problem

A tree-like substructure on a computer chip whose task is to carry a signal from a source circuit to possibly many sink circuits and which consists only of wires and so-called repeater circuits is called a repeater tree. We present a mathematical formulation of the optimization problems related to the construction of such repeater trees. Furthermore, we prove theoretical properties of a simple iterative procedure for these problems which was successfully applied in practice.

Jens Vygen | Dieter Rautenbach | Jens Maßberg | Stephan Held | Christoph Bartoschek

[1] Leon Gordon Kraft,et al. A device for quantizing, grouping, and coding amplitude-modulated pulses , 1949 .

[2] W. C. Elmore. The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

[3] Dieter Rautenbach,et al. Binary trees with choosable edge lengths , 2009, Inf. Process. Lett..

[4] Jens Vygen,et al. Efficient generation of short and fast repeater tree topologies , 2006, ISPD '06.

[5] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[6] Jens Vygen,et al. Fast buffering for optimizing worst slack and resource consumption in repeater trees , 2009, ISPD '09.

[7] G.E. Moore,et al. Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[8] Jason Cong,et al. An interconnect-centric design flow for nanometer technologies , 1999, 1999 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers. (Cat. No.99TH8453).

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

[10] Noga Alon,et al. On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[11] Noel Menezes,et al. The scaling challenge: can correct-by-construction design help? , 2003, ISPD '03.