How to obtain more compactable channel routing solutions

The authors present several powerful techniques which allow them to generate efficiently channel routing solutions which are beneficial to further compaction. These techniques can be applied to straight-track compaction as well as to contour-routing compaction and produce very encouraging results. In particular, for D.N. Deutsch's (1985) Difficult Example, they obtained straight-track routing solution with an area 7% less than the best known result after straight-track compaction. The router generated a routing solution using less area than reported results of all well known routers after contour-routing compaction.<<ETX>>

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

[2]  Ernest S. Kuh,et al.  Nutcracker: An Efficient and Intelligent Channel Spacer , 1987, 24th ACM/IEEE Design Automation Conference.

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

[4]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[5]  Jason Cong.  A New Approach to Three Layer Channel Routing , 1987 .

[6]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1982, DAC 1982.

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

[8]  R. Pelavin,et al.  Hierarchical channel router , 1988, 25 years of DAC.

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

[10]  Oliver Vornberger,et al.  On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..

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

[12]  Jiri Soukup,et al.  Geometrical Compaction in One Dimension for Channel Routing , 1987, 24th ACM/IEEE Design Automation Conference.

[13]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .