Efficient final placement based on nets-as-points

Authors:
X. Zhang;T. L. Pillage;R. A. Rohrer
Affiliations:
Department of Electrical Com.puter Engineering, Carnegie Mellon University, Pittsburgh, PA;Department of Electrical Com.puter Engineering, Carnegie Mellon University, Pittsburgh, PA;Department of Electrical Com.puter Engineering, Carnegie Mellon University, Pittsburgh, PA
Venue:
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Year:
1989

Citing 8
Cited 1

Proud: a fast sea-of-gates placement algorithm

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A quadratic metric with a simple solution scheme for initial placement

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
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
TimberWolf3.2: a new standard cell placement and global routing package

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

Using controlled experiments in layout

ACM SIGDA Newsletter

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deterministic optimization programs are coming to be considered as viable alternatives for the placement of very large sea-of-gate, gate array and standard cell designs. A nets-as-points placement program has been described which provides competitive results in comparison with non-deterministic placement, and at a fraction of the run time. A new pseudo Steiner tree model for the gate placement about the netpoints, along with a virtual channel snap-to-grid procedure, provides results superior to the original nets-as-points placement program without requiring iterative improvement.