CASH: A novel quadratic placement algorithm for very large standard cell layout design based on clustering

摘要

In this paper, we present a novel placement algorithm for very large standard cell layout design. Our approach combines the well-known quadratic placement method with the bottom-up clustering strategy. This algorithm is based on strict mathematical analysis, and provably can find the global optima in very short time. Our method is simple but rather efficient that it can not only significantly reduce the problem size, but also imporve the performance of the quadratic placement. We have tested our algorithm on a set of MCNC benchmarks and consistently obtained excellent results.