Global routing based on Steiner min-max trees

Global routing of multiterminal nets is studied. A novel global router is proposed; each step consists of finding a tree, called a Steiner min-max tree, that is Steiner tree with maximum-weight edge minimized (real vertices represent channels containing terminals of a net, Steiner vertices represent intermediate channels, and weights correspond to densities). An O (min(e loglog e, n/sup 2/)) time algorithm is proposed for obtaining a Steiner min-max tree in a weighted graph with e edges and n vertices. (This result should be contrasted with the NP-completeness of the traditional minimum-length Steiner tree problem). Experimental results on difficult examples, on randomly generated data, on master slice chips, and on benchmark examples from the Physical Design Workshop are included. >

[1]  Dana S. Richards,et al.  An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[3]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[4]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

[5]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[7]  Richard M. Karp,et al.  Global wire routing in two-dimensional arrays , 1987, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8]  Carl Sechen,et al.  A new global router for row-based layout , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[9]  Chak-Kuen Wong,et al.  A New Approach to the Rectilinear Steiner Tree Problem , 1989, 26th ACM/IEEE Design Automation Conference.

[10]  J. S. Lee,et al.  Use of steiner's problem in suboptimal routing in rectilinear metric , 1976 .

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

[12]  Malgorzata Marek-Sadowska,et al.  Global Routing for Gate Array , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Eugene Shragowitz,et al.  A global router based on a multicommodity flow model , 1987, Integr..

[14]  Ravi Nair,et al.  A Simple Yet Effective Technique for Global Wiring , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Ben Ting,et al.  Routing Techniques for Gate Array , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  Chak-Kuen Wong,et al.  A Hierarchical Global Wiring Algorithm for Custom Chip Design , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Scott Kirkpatrick,et al.  Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[19]  Andrew Chi-Chih Yao,et al.  An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[20]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[21]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[22]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[23]  Ralph Linsker,et al.  An Iterative-Improvement Penalty-Function-Driven Wire Routing System , 1984, IBM J. Res. Dev..