Pyramids: An efficient computational geometry-based approach for timing-driven placement
ICCAD(2008)
摘要
The purpose of global placement is to find non-overlapping locations for cells, typically while minimizing a wirelength objective. Because of this objective, however, when more timing information about the design is known, some cells will inevitably be sub-optimally placed from a timing perspective. In this paper, we present two new techniques to incrementally improve placements by moving cells to their optimal timing locations. We call our approach Pyramids, since it uses pyramid-shaped delay surfaces to solve for the optimal location, rather than running a more expensive linear programming solver. We show how to apply these techniques to timing-driven detailed placement and also for more accurate latestage incremental timing correction. Experimental results validate the effectiveness of Pyramids by showing significantly improved timing after an industrial placement algorithm. Furthermore, compared to the linear programming solvers, the speedup of Pyramids solver is 373x vs. CLP and 448x vs. GLPK.
更多查看译文
关键词
approach pyramids,detailed placement,integrated circuit interconnections,pyramids solver,accurate latestage incremental timing,global placement,industrial placement algorithm,timing-driven placement,timing perspective,optimal timing locations,optimal timing location,efficient computational geometry-based approach,timing information,integrated circuit layout,improved timing,computational geometry-based approach,optimization,mathematical model,computational geometry,linear program,logic gates
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络