The Orientation of Modules Based on Graph Decomposition

In the layout stage of VLSI and printed circuit board (PCB) design, after all circuit modules (rectangular) are placed, it is possible to flip the modules so as to reduce the total net length. The authors formulate the orientation of modules as a graph problem and prove it to be NP-complete. The orientation problem is shown to be equivalent to finding a minimum cut of a graph with some arcs of negative capacities. In many cases, the graph can be decomposed into subgraphs to reduce the search space for optimum orientation. Experiments with real cases show that module orientation reduces the total net length and improves the routability. >

[1]  T. C. Hu,et al.  Combinatorial algorithms , 1982 .

[2]  Viktor K. Prasanna,et al.  Information Transfer in Distributed Computing with Applications to VLSI , 1984, JACM.

[3]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[4]  S. Purushothaman.  Reasoning About Modular Systolic Algorithms. , 1987 .

[5]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[6]  H. T. Kung,et al.  Wafer-scale integration and two-level pipelined implementations of systolic arrays , 1984, J. Parallel Distributed Comput..

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

[8]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[9]  Jr. James Edward Stevens.  Fast heuristic techniques for placing and wiring printed circuit boards , 1972 .

[10]  Viktor K. Prasanna,et al.  On Mapping Algorithms to Linear and Fault-Tolerant Systolic Arrays , 1989, IEEE Trans. Computers.

[11]  P. Quinton.  Automatic synthesis of systolic arrays from uniform recurrent equations , 1984, ISCA 1984.

[12]  C. L. Liu,et al.  A new approach to the pin assignment problem , 1988, DAC '88.

[13]  Benjamin W. Wah,et al.  Systematic approaches to the design of algorithmically specified systolic arrays , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[14]  Bryan T. Preas,et al.  Automatic Placement A Review of Current Techniques , 1986, DAC 1986.

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

[16]  Ernest S. Kuh,et al.  VLSI circuit layout : theory and design , 1985 .

[17]  Peter R. Cappello,et al.  Unifying VLSI Array Designs with Geometric Transformations , 1983, International Conference on Parallel Processing.

[18]  I. V. Ramakrishnan,et al.  SYSTOLIC MATRIX MULTIPLICATION ON A LINEAR ARRAY. , 1982 .

[19]  I. V. Ramakrishnan,et al.  Modular Matrix Multiplication on a Linear Array , 1984, IEEE Trans. Computers.

[20]  KSHITIJ A. DOSHI,et al.  Optimal Graph Algorithms on a Fixed-Size Linear Array , 1987, IEEE Transactions on Computers.

[21]  Bryan Preas,et al.  Automatic Placement A Review of Current Techniques , 1986, 23rd ACM/IEEE Design Automation Conference.

[22]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .