An efficient VLSI switch-box router

A tool for switch-box routing that can route regions with cyclic constraints and with terminals on three or four sides is presented. A divide-and-conquer algorithm is used to explore the greedy channel routing idea, using techniques such as routing area partitioning, dynamic routing strategies, and sweeping concurrent bidirectional columns. The routing area is decomposed into three parts by two special lines cut parallel, making routing easier. The algorithm completely routes Burstein's switch-box problem and with an extension also routes the Deutsch channel example in 19 tracks.<<ETX>>

[1]  D. Ross.  Computer-aided design , 1961, CACM.

[2]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[3]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

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

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

[6]  Daniel P. Siewiorek,et al.  WEAVER: A Knowledge-Based Routing Expert , 1986 .

[7]  J. Soukup.  Circuit layout , 1981, Proceedings of the IEEE.

[8]  John K. Ousterhout,et al.  A Switchbox Router with Obstacle Avoidance , 1984, 21st Design Automation Conference Proceedings.

[9]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  R.L. Rivest,et al.  A "Greedy" Channel Router , 1982, 19th Design Automation Conference.

[13]  D. Munson.  Circuits and systems , 1982, Proceedings of the IEEE.

[14]  Chi-Ping Hsu.  A New Two-Dimensional Routing Algorithm , 1982, 19th Design Automation Conference.

[15]  Alberto L. Sangiovanni-Vincentelli,et al.  A New Symbolic Channel Router: YACR2 , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  David N. Deutsch,et al.  A “DOGLEG” channel router , 1976, DAC '76.

[17]  Amtliches Mitteilungsblatt,et al.  August , 1890, The Hospital.

[18]  W. K. Luk,et al.  A greedy switch-box router , 1985, Integr..

[19]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

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

[21]  Thomas G. Szymanski.  Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  Malgorzata Marek-Sadowska.  Two-Dimensional Router for Double Layer Layout , 1985, 22nd ACM/IEEE Design Automation Conference.