This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Conference on Design Automation (DAC'00)
Timing-Driven Placement based on Partitioning with Dynamic Cut-Net Control
Los Angeles, CA
June 05-June 09
ISBN: 1-58113-1897-9
Massoud Pedram, University of Southern California, Los Angeles
Shih-Lian Ou, University of Southern California, Los Angeles
This paper presents a partitioning-based, timing-driven placement algorithm. The partitioning step itself is timing-driven and based on solving a quadratic programming problem iteratively. The placement algorithm does not rely on interleaved timing calculations, which tend to be inaccurate. Instead, it achieves the desired result by controlling the number of times that a path in the circuit can be cut. In addition to the cutting constraint, apre-locking mechanism and timing-aware terminal propagation are developed and integrated into the flow. The detailed placement stepis formulated as a constrained quadratic program and solved efficiently. Results show improvements of 23.41% on average compared to another timing driven placement system Timing-QUAD andsignificant improvements over Eisenmanns placement algorithm.
Index Terms:
co-simulation, configurable processor cores, coverage analysis, design verification, system-on-chip, test generation
Citation:
Massoud Pedram, Shih-Lian Ou, "Timing-Driven Placement based on Partitioning with Dynamic Cut-Net Control," dac, pp.472-476, 37th Conference on Design Automation (DAC'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.