ComPLx: A Competitive Primal-dual Lagrange Optimization for Global Placement

We develop a projected-subgradient primal-dual Lagrange optimization for global placement, that can be instantiated with a variety of interconnect models. It decomposes the original non-convex problem into“more convex”sub-problems. It generalizes the recent SimPL, SimPLR and Ripple algorithms and extends them. Empirically, ComPLx outperforms all published placers in runtime and performance on ISPD 2005 and 2006 benchmarks. Categories and Subject Descriptors B.7.2 [Hardware, Integrated Circuits]: Design Aids— Placement and routing General Terms Algorithms, Design, Performance Keywords Algorithms, optimization, physical design, placement

• Type: Journal
• Year: 2012
• Where: DAC
• Authors: Myung-Chul Kim, Igor L. Markov
• Keywords: Computer Architecture, DAC 2012, Design Aids, Integrated Circuits Design, ISPD 2005