DocumentCode :
565207
Title :
ComPLx: A competitive primal-dual Lagrange optimization for global placement
Author :
Kim, Myung-Chul ; Markov, Igor L.
Author_Institution :
EECS Dept., Univ. of Michigan, Ann Arbor, MI, USA
fYear :
2012
fDate :
3-7 June 2012
Firstpage :
747
Lastpage :
755
Abstract :
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.
Keywords :
circuit optimisation; integrated circuit interconnections; integrated circuit layout; integrated circuit modelling; ComPLx; Ripple algorithm; SimPLR algorithm; competitive primal-dual Lagrange optimization; global placement; interconnect model; nonconvex problem; projected-subgradient primal-dual Lagrange optimization; Algorithm design and analysis; Approximation methods; Benchmark testing; Convergence; Layout; Optimization; Runtime; Algorithms; optimization; physical design; placement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference (DAC), 2012 49th ACM/EDAC/IEEE
Conference_Location :
San Francisco, CA
ISSN :
0738-100X
Print_ISBN :
978-1-4503-1199-1
Type :
conf
Filename :
6241589
Link To Document :
بازگشت