Placement Initialization via a Projected Eigenvector Algorithm
TimeWednesday, July 13th6pm - 7pm PDT
LocationLevel 2 Lobby
Event Type
Late Breaking Results Poster
Networking Reception
Description"Canonical methods for analytical placement of VLSI designs rely on solving nonlinear programs to minimize wirelength and cell overlap. We focus on producing initial layouts such that a global analytical placer performs better compared to existing heuristics for initialization. We reduce the problem of initialization to a quadratically constrained quadratic program. Our formulation is aware of fixed macros and is capable of handling fence-region constraints. We propose an efficient algorithm which can quickly generate initializations for large testcases (millions of cells). We show that the proposed approach for parameter initialization results in superior performance with respect to post-detailed placement wirelength."