Minimizing External Wires in Generalized Single-Row Routing

Much of the recent work on the automated design of VLSI chips has concentrated on routing problems associated with such designs. One major class of routing problems focuses on single-row routing. Recently, the traditional single-row routing model has been generalized to allow external wires. Under this generalized model, it is possible to route many more single-row routing instances than in the traditional model. There is, however, a clear disadvantage in the use of external wires, since they force a lengthening of the channels surrounding the single row of terminals. Thus, it is desirable for these generalized single-row routings to use a minimum number of external wires. A linear-time algorithm for determining the minimum number of external wires needed to route a given instance of single-row routing is provided here. >

[1]  Richard J. Enbody,et al.  Near-Optimal n-Layer Channel Routing , 1986, DAC 1986.

[2]  Dave Johannsen,et al.  Bristle Blocks: A Silicon Compiler , 1979, 16th Design Automation Conference.

[3]  Sartaj Sahni,et al.  Single Row Routing , 1983, IEEE Transactions on Computers.

[4]  Ron Y. Pinter,et al.  On minimizing channel density by lateral shifting , 1983 .

[5]  Chak-Kuen Wong,et al.  Optimal Wiring of Movable Terminals , 1983, IEEE Transactions on Computers.

[6]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[7]  Ron Y. Pinter,et al.  Optimal Placement for River Routing , 1983 .

[8]  S. S. Ravi,et al.  One-Layer Routing without Component Constraints , 1984, J. Comput. Syst. Sci..

[9]  Errol L. Lloyd,et al.  The Impact of wire Topology on Single Row Routing , 1992, J. Circuits Syst. Comput..

[10]  Arnold L. Rosenberg,et al.  Three-Dimensional VLSI: a case study , 1983, JACM.

[11]  Errol L. Lloyd,et al.  The Benefits of External Wires in Single Row Routing , 1991, Inf. Process. Lett..

[12]  Sartaj Sahni,et al.  The complexity of single row routing , 1984 .

[13]  Richard J. Enbody,et al.  Near-Optimal n-Layer Channel Routing , 1986, 23rd ACM/IEEE Design Automation Conference.

[14]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[15]  Errol L. Lloyd,et al.  Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract) , 1986, Aegean Workshop on Computing.

[16]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[17]  Jean Ragan Stephenson Blair.  The impact of wire topology on channel routing , 1986 .