Sciweavers

Share
ISPD
2003
ACM

Timing driven force directed placement with physical net constraints

9 years 1 months ago
Timing driven force directed placement with physical net constraints
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first force directed placement algorithm that meets precise half perimeter bounding box constraints on critical nets. It builds on the work of Eisenmann et al. [12], adding a new net model that changes the contribution of constrained nets in the quadratic programming problem, during solving for each force generation step. We propose several methods for selecting and constraining critical nets to achieve improved timing. Our work suggests that the force directed method with net constraints is a powerful tool for placement and timing convergence, achieving an average worst negative slack optimization exploitation of 64% and average total negative slack optimization exploitation of 48% results on 16
Karthik Rajagopal, Tal Shaked, Yegna Parasuram, Tu
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where ISPD
Authors Karthik Rajagopal, Tal Shaked, Yegna Parasuram, Tung Cao, Amit Chowdhary, Bill Halpin
Comments (0)
books