Graph-theory-based simplex algorithm for VLSI layout spacingproblems with multiple variable constraints

An efficient algorithm is provided for solving a class of linear programming problems containing a large set of distance constraints of the form x/sub i/-x/sub j//spl ges/k and a small set of multivariable constraints of forms other than x/sub i/-x/sub j//spl ges/k. This class of linear programming formulation is applicable to very large scale integration (VLSI) layout spacing problems, including hierarchy-preserving hierarchical layout compaction, layout compaction with symmetric constraints, layout compaction with attractive and repulsive constraints, performance-driven layout compaction, etc. The longest path algorithm is efficient for solving spacing problems containing only distance constraints. However, it fails to solve problems that involve multiple-variable constraints. The linear programming formulation of a spacing problem requires use of the simplex method, which involves many matrix operations. This can be very time consuming when handling huge constraints systems derived from VLSI layouts. Herein it is found that most of the matrix operations can be replaced with fewer and faster graph operations, creating a more efficient graph-theory-based algorithm. Theoretical analysis shows that the proposed algorithm reduces the computation complexity of the simplex method.

[1]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[2]  Hidetoshi Onodera,et al.  An efficient algorithm for layout compaction problem with symmetry constraints , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[3]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[4]  Cyrus Bamji,et al.  Cloning techniques for hierarchical compaction , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[5]  David G. Boyer.  Symbolic layout compaction review , 1988, DAC '88.

[6]  David Marple.  A hierarchy preserving hierarchical compactor , 1991, DAC '90.

[7]  Ernest S. Kuh,et al.  Performance driven spacing algorithms using attractive and repulsive constraints for submicron LSI's , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Takeshi Yoshimura,et al.  GRAPH THEORETICAL COMPACTION ALGORITHM. , 1985 .

[9]  Y.E. Cho.  A Subjective Review of Compaction , 1985, 22nd ACM/IEEE Design Automation Conference.

[10]  Jonathan Allen,et al.  Minplex - A Compactor that Minimizes the Bounding Rectangle and Individual Rectangles in a Layout , 1986, DAC 1986.

[11]  Akira Onozawa.  Layout compaction with attractive and repulsive constraints , 1991, DAC '90.

[12]  Chi-Yuan Lo,et al.  Cell-Based Hierarchical Pitchmatching Compaction Using Minimal LP , 1993, 30th ACM/IEEE Design Automation Conference.

[13]  Chak-Kuen Wong,et al.  An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Yen-Tai Lai,et al.  Layout compaction with minimized delay bound on timing critical paths , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[15]  Yen-Tai Lai,et al.  A graph-based simplex algorithm for minimizing the layout size and the delay on timing critical paths , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[16]  D. Tang,et al.  HIMALAYAS-A hierarchical compaction system with a minimized constraint set , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.