PROUD: a sea-of-gates placement algorithm
- 1 December 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test of Computers
- Vol. 5 (6) , 44-56
- https://doi.org/10.1109/54.9271
Abstract
An efficient method is proposed for placing modules in large and highly complex sea-of-gates chips that include preplaced I/O pads and macrocells. PROUD repeatedly solves sparse linear equations. A resistive network analogy of the placement problem and convexity of the objective function are key concepts in this algorithm. The algorithm was tested on nine real circuits. For a triple-metal-layer, 100000-gate sea-of-gate design with 26000 instances, the constructive phase took 50 minutes on a VAX 8650 and yielded excellent results for total wire length. Extensions of the method are considered.Keywords
This publication has 3 references indexed in Scilit:
- Module Placement Based on Resistive Network OptimizationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph RepresentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- An r-Dimensional Quadratic Placement AlgorithmManagement Science, 1970