Proud: a fast sea-of-gates placement algorithm

  • Authors:
  • Ren-Song Tsay;Ernest S. Kuh;Chi-Ping Hsu

  • Affiliations:
  • Department of EECS and the Electronics Research Laboratory, University of California, Berkeley, CA;Department of EECS and the Electronics Research Laboratory, University of California, Berkeley, CA;Hughes Aircraft Company, 500 Superior Avenue, Newpwrt Beach, Ca

  • Venue:
  • DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a fast and effective placement algorithm which takes advantage of inherent scarcity in the connectivity specification. It solves repeatedly sparse linear equations by the SOR (Successive Over-Relaxation) method in a top-down hierarchy. The algorithm has been implemented; for a triple-metal-layer 100K sea-of-gates design with 26,000 instances, it takes 50 minutes on a VAX 8650 and yields excellent results.