On the Relative Placement and the Transportation Problem for Standard-Cell Layout

A new two-phased method for the simultaneous placement of modules for standard-cell layout is presented. In phase one, a relative placement is calculated by application of an iterative solution method taking advantage of net-list scarcity. A fast algorithm is derived from a new formulation of the problem. In addition, signal weights and pin coordinates are considered. In phase two, different-sized modules are assigned to physical locations by solving a transportation problem .

[1]  Arvind M. Patel,et al.  Partitioning for VLSI Placement Problems , 1981, 18th Design Automation Conference.

[2]  Melvin A. Breuer,et al.  A class of min-cut placement algorithms , 1988, DAC '77.

[3]  N. Quinn,et al.  A forced directed component placement procedure for printed circuit boards , 1979 .

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

[5]  J. Blanks.  Near-Optimal Placement Using a Quadratic Objective Function , 1985, DAC 1985.

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

[7]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Maurice Hanan,et al.  Some experimental results on placement techniques , 1976, DAC.

[9]  D. A. Mlynski,et al.  A Combined Force and Cut Algorithm for Hierarchical VLSI Layout , 1982, DAC 1982.

[10]  Chung-Kuan Cheng,et al.  Module Placement Based on Resistive Network Optimization , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.