A quadratic metric with a simple solution scheme for initial placement

For the initial placement problem a nets-as-points model provides a quadratic cost metric which when minimized localizes the gates. Fixed constraints are added to the cost function so that a minimum is guaranteed to exist, and can be obtained by means of a simple iterative solution. The initial placement is obtained in near linear time. An annular snap-to-grid heuristic completes the initial placement. The nets-as-points metric is shown to produce desirable results.

[1]  John P. Blanks.  Near-Optimal Placement Using a Quadratic Objective Function , 1985, 22nd ACM/IEEE Design Automation Conference.

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

[3]  Kenneth M. Hall.  An r-Dimensional Quadratic Placement Algorithm , 1970 .

[4]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[5]  Frank M. Johannes,et al.  On the Relative Placement and the Transportation Problem for Standard-Cell Layout , 1986, 23rd ACM/IEEE Design Automation Conference.

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

[7]  Brian W. Kernighan,et al.  A proper model for the partitioning of electrical circuits , 1972, DAC '72.

[8]  Gilbert Strang,et al.  Introduction to applied mathematics , 1988 .

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.