A deep-submicron steiner tree

Authors:
A. I. Erzin;J. D. Cho
Affiliations:
Institute of Mathematics, Siberian Department of RAS pr. Koptiuga, 4, Novosibirsk, 630090, Russia;School of Elec. and Computer Engineering Sung Kyun Kwan University, Suwon, Korea, 440746
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2000

Citing 5
Cited 0

Steiner problem in networks: a survey

Networks
Bounded-skew clock and Steiner routing under Elmore delay

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
A min-cost flow based min-cost rectilinear Steiner distance-preserving tree construction

Proceedings of the 1997 international symposium on Physical design
Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design

Proceedings of the 1997 international symposium on Physical design
Constructing Minimal Spanning/Steiner Trees with Bounded Path Length

EDTC '96 Proceedings of the 1996 European conference on Design and Test

Quantified Score

Hi-index	0.98

Visualization

Abstract

An A-Tree is a rectilinear Steiner tree in which every sink is connected to a driver by a shortest length path, while simultaneously minimizing total wire length. This paper presents a polynomial approximation algorithm for the generalized version of an A-Tree problem with upper-bounded delays along each path from the driver to the sinks and with restrictions on the number of Steiner nodes. We refer to it as ''Deep-submicron Steiner tree'', as minimizing the number of Steiner nodes is crucial for signal integrity issues in deep-submicron Very-Large-Scaled-Integrated-circuit (VLSI) designs. The idea behind the algorithm is to control two parameters in order to construct a feasible (with respect to the paths delays and the number of Steiner nodes) tree of small cost. The simulation results show the high efficiency of our approach.