Pyramids: an efficient computational geometry-based approach for timing-driven placement

Authors:
Tao Luo;David A. Papa;Zhuo Li;C. N. Sze;Charles J. Alpert;David Z. Pan
Affiliations:
Magma Design Automation, Austin, TX and University of Texas at Austin, Austin, TX;University of Michigan, Ann Arbor, MI and IBM Austin Research Lab, Austin, TX;IBM Austin Research Lab, Austin, TX;IBM Austin Research Lab, Austin, TX;IBM Austin Research Lab, Austin, TX;University of Texas at Austin, Austin, TX
Venue:
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Year:
2008

Citing 14
Cited 1

Performance optimization of VLSI interconnect layout

Integration, the VLSI Journal
Global wires: harmful?

ISPD '98 Proceedings of the 1998 international symposium on Physical design
Timing driven placement using physical net constraints

Proceedings of the 38th annual Design Automation Conference
A novel net weighting algorithm for timing-driven placement

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Sensitivity guided net weighting for placement driven synthesis

Proceedings of the 2004 international symposium on Physical design
Fast and flexible buffer trees that navigate the physical layout environment

Proceedings of the 41st annual Design Automation Conference
Incremental Placement for Timing Optimization

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Early research experience with OpenAccess gear: an open source development environment for physical design

Proceedings of the 2005 international symposium on Physical design
How accurately can we model timing in a placement engine?

Proceedings of the 42nd annual Design Automation Conference
An LP-based methodology for improved timing-driven placement

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
A new LP based incremental timing driven placement for high performance designs

Proceedings of the 43rd annual Design Automation Conference
RUMBLE: an incremental, timing-driven, physical-synthesis optimization algorithm

Proceedings of the 2008 international symposium on Physical design
Repeater scaling and its impact on CAD

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Accurate estimation of global buffer delay within a floorplan

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Ultra-fast interconnect driven cell cloning for minimizing critical path delay

Proceedings of the 19th international symposium on Physical design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.