An efficient routing database

Routing is an important problem in the process of design creation. In this paper, we focus on the problem of designing a database for the non-partitioned routing problem. New technology libraries describe constraints that are hard to manage in grid-based approaches to the routing database. While general region query based data-structures have been proposed, they typically suffer from speed problems when applied to large blocks. We introduce an interval-based approach. It provides more flexibility than grid-based techniques. It exploits the notion of preferred direction for metal layers to manage the memory efficiently. It supports efficient region queries. We finally present a comparison study for real industrial designs on this database.

[1]  Dileep A. Divekar.  Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools , 1984 .

[2]  Asmus Hetzel,et al.  A sequential detailed router for huge grid graphs , 1998, Proceedings Design, Automation and Test in Europe.

[3]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

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

[5]  Jason Cong,et al.  An implicit connection graph maze routing algorithm for ECO routing , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[6]  D. Hightower,et al.  A solution to line routing problems on the continuous plane , 1988 .

[7]  Narendra V. Shenoy,et al.  A robust solution to the timing convergence problem in high-performance design , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[8]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[9]  Paul G. Villarrubia,et al.  An integrated placement and synthesis approach for timing closure of PowerPC/sup TM/ microprocessors , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[10]  Kenneth L. Clarkson,et al.  Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time , 1987, SCG '87.

[11]  David Marple,et al.  Tailor: a layout system based on trapezoidal corner stitching , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[13]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[14]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[15]  Jonathan B. Rosenberg,et al.  Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  Donald S. Fussell,et al.  HV/VH Trees: A New Spatial Data Structure for Fast Region Queries , 1993, 30th ACM/IEEE Design Automation Conference.

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

[18]  Willy M. C. Sansen,et al.  A Line-Expansion Algorithm for the General Routing Problem with a Guaranteed Solution , 1980, 17th Design Automation Conference.

[19]  Gershon Kedem.  The Quad-CIF Tree: A Data Structure for Hierarchical On-Line Algorithms , 1982, 19th Design Automation Conference.

[20]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

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

[22]  Randy Lee Brown.  Multiple Storage Quad Trees: A Simpler Faster Alternative to Bisector List Quad Trees , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.