The Community for Technology Leaders
RSS Icon
Subscribe
Los Angeles, CA
June 5, 2000 to June 9, 2000
ISBN: 1-58113-1897-9
pp: 472-476
Massoud Pedram , University of Southern California, Los Angeles
Shih-Lian Ou , University of Southern California, Los Angeles
ABSTRACT
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, 2000, Design Automation Conference, Design Automation Conference 2000, pp. 472-476, doi:10.1109/DAC.2000.855357
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool