This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
PROUD: A Sea-Of-Gates Placement Algorithm
November/December 1988 (vol. 5 no. 6)
pp. 44-56

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.

Citation:
Ren-Song Tsay, Ernest S. Kuh, Chi-Ping Hsu, "PROUD: A Sea-Of-Gates Placement Algorithm," IEEE Design & Test of Computers, vol. 5, no. 6, pp. 44-56, Nov.-Dec. 1988, doi:10.1109/54.9271
Usage of this product signifies your acceptance of the Terms of Use.