Location of Repository

Minimum Density Interconnection Trees

By C. J. Alpert, J. Cong, A. B. Kahng, G. Robins and M. Sarrafzadeh

Abstract

We discuss a new minimum density objective for spanning and Steiner tree constructions. This formulation is motivated by the need for balanced usage of routing resources to achieve minimum-area VLSI layouts. We present efficient heuristics for constructing low-density spanning trees, and prove that their outputs are on average within small constants of optimal with respect to both tree weight and density. The minimum density objective can be transparently combined with a number of previous interconnection objectives (e.g., minimizing radius or skew), without affecting the solution quality with respect to these previous metrics. Extensive simulation results suggest that applications to VLSI global routing are promising. 1 Introduction We address a new minimum density objective for spanning and Steiner tree constructions in the Manhattan plane. Our work is motivated by the area minimization requirement inherent in the global routing phase of VLSI layout (the global routing phase entail..

Year: 1992
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.886
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ballade.cs.ucla.edu/~co... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.