The Community for Technology Leaders
Green Image
Issue No. 06 - November/December (1988 vol. 5)
ISSN: 0740-7475
pp: 44-56
<p>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.</p>
Ernest S. Kuh, Ren-Song Tsay, Chi-Ping Hsu, "PROUD: A Sea-Of-Gates Placement Algorithm", IEEE Design & Test of Computers, vol. 5, no. , pp. 44-56, November/December 1988, doi:10.1109/54.9271
108 ms
(Ver 3.3 (11022016))