A new approach to three- or four-layer channel routing

An approach to the three-layer or four-layer channel-routing problem is presented. A general technique that transforms a two-layer routing solution systematically into a three-layer routing solution is developed. The proposed router performs well in comparison with other three-layer channel routers proposed thus far. In particular, it provides a ten-track optimal solution for the famous Deutsch's difficult example, whereas other well-known three-layer channel routers required 11 or more tracks. The approach is extended to four-layer channel routing. Given any two-layer channel-routing solution without an unrestricted dogleg that uses w tracks, the router can obtain a four-layer routing solution using no more than w/2 tracks. A theoretical upper bound d/2+2 for arbitrary four-layer channel routing problems is also given. >

[1]  A. Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC '71.

[2]  Susanne E. Hambrusch.  Channel Routing Algorithms for Overlap Models , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Yun Kang Chen,et al.  Three-Layer Channel Routing , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Michael Burstein,et al.  Hierarchical channel router , 1984 .

[5]  David N. Deutsch.  A “DOGLEG” channel router , 1976, DAC 1976.

[6]  Harold N. Gabow,et al.  An Almost-Linear Algorithm for Two-Processor Scheduling , 1982, JACM.

[7]  C. L. Liu,et al.  NEW APPROACH TO THE THREE LAYER CHANNEL ROUTING PROBLEM. , 1987 .

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Alberto L. Sangiovanni-Vincentelli,et al.  Chameleon: A New Multi-Layer Channel Router , 1986, 23rd ACM/IEEE Design Automation Conference.

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

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

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

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

[14]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

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

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

[17]  Martin D. F. Wong,et al.  Compacted channel routing with via placement restrictions , 1986, Integr..