Channel density minimization by pin permutation

A linear-time optimal algorithm for minimizing the density of a channel (with exits) by permuting the terminals on the two sides of the channel is presented. It compares favorably with the near-optimal algorithm of J. Cong and K.-Y. Khoo (1991) that runs in superlinear time. The present algorithm has important applications in hierarchical layout design of integrated circuits. In addition, it is shown that the problem of minimizing wire length by permuting terminals is NP-hard in the strong sense.<<ETX>>

[1]  Jason Cong,et al.  A provable near-optimal algorithm for the channel pin assignment problem , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[2]  Jason Cong.  Pin assignment with global routing , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

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

[4]  C. L. Liu,et al.  Permutation Channel Routing , 1988 .

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

[6]  Yang Cai,et al.  Minimizing channel density by shifting blocks and terminals , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[7]  Michael Burstein,et al.  Hierarchical Channel Router , 1983, 20th Design Automation Conference Proceedings.

[8]  C. Y. Roger Chen,et al.  A hierarchical methodology to improve channel routing by pin permutation , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[9]  Jason Cong,et al.  Channel Density Minimization by Pin Permutation , 1994 .

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

[11]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[12]  Spyros Tragoudas,et al.  Interchanging terminals for improved channel routing , 1990, IEEE International Symposium on Circuits and Systems.

[13]  Jitender S. Deogun,et al.  Via minimization in VLSI routing with movable terminals , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Yang Cai,et al.  Optimal channel pin assignment , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Hideaki Kobayashi,et al.  Efficient Algorithms for Routing Interchangeable Terminals , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

[18]  Chak-Kuen Wong,et al.  An Optimal Algorithm for the Maximum Alignment of Terminals , 1985, Inf. Process. Lett..

[19]  Malgorzata Marek-Sadowska,et al.  Floorplanning with pin assignment , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[20]  C. L. Liu,et al.  Algorithms for permutation channel routing , 1987, Integr..

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

[22]  Yang Cai,et al.  An optimal channel pin assignment algorithm , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

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

[24]  Martin D. F. Wong,et al.  Optimal orientations of transistor chains , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[25]  Martin D. F. Wong,et al.  Optimal module implementation and its application to transistor placement , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[26]  Sartaj Sahni,et al.  Two NP-hard interchangeable terminal problems , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..