On the Use of the Linear Assignment Algorithm in Module Placement

This paper examines the application of the computationally powerful linear assignment algorithm to the placement problem. A brief description of the algorithm is given, followed by a discussion of its use with various problem constraints, for improving existing placements, and in a constructive-initial placement procedure. Several examples are included.

[1]  Roland Silver.  Algorithm 27: assignment , 1960, CACM.

[2]  W. M. vanCleemput.  On the topological aspects of the circuit layout problem , 1976, DAC 1976.

[3]  Charles L. Owen,et al.  Prestructuring model for system-arrangement problems☆ , 1981 .

[4]  Martin J. Welt.  NOMAD: A printed wiring board layout system , 1975, DAC '75.

[5]  Arnold Weinberger,et al.  Formal Procedures for Connecting Terminals with a Minimum Total Wire Length , 1957, JACM.

[6]  Gilles Fortin.  BUBBLE: Relationship Diagrams Using Iterative Vector Approximation , 1978, 15th Design Automation Conference.

[7]  Ming S. Hung,et al.  Solving the Assignment Problem by Relaxation , 1980, Oper. Res..

[8]  Roland Silver.  An algorithm for the assignment problem , 1960, CACM.

[9]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[10]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[11]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[12]  Arvind M. Patel,et al.  The Interchange Algorithms for Circuit Placement Problems , 1980, 17th Design Automation Conference.

[13]  Andrew J. Matthews.  A human engineered PCB design system , 1977, DAC '77.

[14]  Isao Shirakawa,et al.  An Approach to Gate Assignment and Module Placement for Printed Wiring Boards , 1978, IEEE Transactions on Computers.

[15]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[16]  Charles F. Shupe.  Automatic component placement in the nomad system , 1975, DAC '75.

[17]  Charles L. Owen,et al.  A Prestructuring Model for System Arrangement Problems , 1980, 17th Design Automation Conference.

[18]  Hanna Ben-joshua Shapira,et al.  A procedure for generating floor plans computer aided design , 1974, DAC '74.

[19]  Ulrich Lauther,et al.  A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation , 1979, 16th Design Automation Conference.

[20]  Douglas C. Schmidt,et al.  An iterative algorithm for placement and assignment of integrated circuits , 1975, DAC '75.

[21]  V. A. Kudryavtsev,et al.  Placement of polygonal components in complex technical systems , 1973 .

[22]  D. L. Caskey,et al.  ACCEL: Automated circuit card etching layout , 1967 .

[23]  Julia Ruch.  Interactive Space Layout: A Graph Theoretical Approach , 1978, 15th Design Automation Conference.

[24]  Maurice Hanan,et al.  A review of the placement and quadratic assignment problems , 1972 .

[25]  Roy L. Russo,et al.  A Heuristic Procedure for the Partitioning and Mapping of Computer Logic Graphs , 1971, IEEE Transactions on Computers.

[26]  Ueda Kazuhiro,et al.  Placement algorithm for logic modules , 1974 .

[27]  R. W. McGuffin,et al.  Automatic ECL LSI design , 1977, DAC '77.

[28]  Robert Simpson Frew.  A Survey of Space Allocation Algorithms in Use in Architectural Design in the Past Twenty Years , 1980, 17th Design Automation Conference.

[29]  R. Gomory,et al.  A Primal Method for the Assignment and Transportation Problems , 1964 .

[30]  R. A. Rutman.  An algorithm for placement of interconnected elements based on minimum wire length , 1964, AFIPS '64 (Spring).