Near-optimal placement using a quadratic objective function
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
On the relative placement and the transportation problem for standard-cell layout
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A proper model for the partitioning of electrical circuits
DAC '72 Proceedings of the 9th Design Automation Workshop
A class of min-cut placement algorithms
DAC '77 Proceedings of the 14th Design Automation Conference
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Efficient final placement based on nets-as-points
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Net partitions yield better module partitions
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A general purpose multiple way partitioning algorithm
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Net Clustering Based Macrocell Placement
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
| Hi-index | 0.00 |
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.