lambda-OAT: lambda-Geometry Obstacle-Avoiding Tree Construction With O(nlog n) Complexity

Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is an essential part of routing. Recently, IC routing and related researches have been extended from Manhattan architecture (lambda2-geometry) to Y-/X-architecture (lambda3-lambda4-geometry) to improve the chip performance. This paper presents an O(n log n) heuristic, lambda-OAT, for obstacle-avoiding Steiner minimal tree construction in the lambda-geometry plane (lambda-OASMT). In this paper, based on obstacle-avoiding constrained Delaunay triangulation, a full connected tree is constructed and then embedded into lambda-OASMT by zonal combination. To the best of our knowledge, this is the first work addressing the lambda-OASMT problem. Compared with most recent works on OARSMT problem, lambda-OAT obtains up to 30-Kx speedup with quality solution. We have tested randomly generated cases with up to 10 K terminals and 10-K rectilinear obstacles within 4 seconds on a Sun V880 workstation (755-MHz CPU and 4-GB memory). The high efficiency and accuracy of lambda-OAT make it extremely practical and useful in the routing phase.

[1]  Cheng-Kok Koh,et al.  Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures , 2000, ACM Great Lakes Symposium on VLSI.

[2]  Zhou Zhi.  On Optimal Rectilinear Shortest Paths and 3-Steiner Tree Routing in Presence of Obstacles , 2003 .

[3]  Martin Zachariasen.  Rectilinear full Steiner tree generation , 1999 .

[4]  Andrew B. Kahng,et al.  Estimation of wirelength reduction for λ-geometry vs. manhattan placement and routing , 2003, SLIP '03.

[5]  Yiyu Shi,et al.  CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[6]  Joseph L. Ganley,et al.  Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[7]  Chak-Kuen Wong,et al.  Hierarchical Steiner tree construction in uniform orientations , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Dave Hightower.  A solution to line-routing problems on the continuous plane , 1969, DAC '69.

[9]  G. Yan,et al.  An-OARSMan: obstacle-avoiding routing tree construction with good length performance , 2005, ASP-DAC '05.

[10]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[11]  Hal Schenck,et al.  Computational Algebraic Geometry , 2003 .

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

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

[14]  S. Sitharama Iyengar,et al.  Finding obstacle-avoiding shortest paths using implicit connection graphs , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Andrew B. Kahng,et al.  Highly scalable algorithms for rectilinear and octilinear Steiner trees , 2003, ASP-DAC '03.

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

[17]  Chris C. N. Chu,et al.  Efficient rectilinear Steiner tree construction with rectilinear blockages , 2005, 2005 International Conference on Computer Design.

[18]  F. Rubin,et al.  The Lee Path Connection Algorithm , 1974, IEEE Transactions on Computers.

[19]  Yang Yang,et al.  Rectilinear Steiner Minimal Tree among obstacles , 2003, ASICON 2003.

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

[21]  D. T. Lee,et al.  The Steiner Minimal Tree Problem in the lambda-Geormetry Plane , 1996, ISAAC.

[22]  G. Yan,et al.  FORst: A 3-Step Heuristic For Obstacle-avoiding Rectilinear Steiner Minimal Tree Construction ? , 2004 .

[23]  Chris Coulston.  Constructing exact octagonal steiner minimal trees , 2003, GLSVLSI '03.

[24]  Kinya Tabuchi,et al.  A computer program for optimal routing of printed circuit conductors , 1968, IFIP Congress.