ACM Home Page
Please provide us with feedback. Feedback
Timing-driven placement based on partitioning with dynamic cut-net control
Full text PdfPdf (106 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 472 - 476  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Shih-Lian Ou  Department of EE-Systems, University of Southern California, Los Angeles, CA
Massoud Pedram  Department of EE-Systems, University of Southern California, Los Angeles, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Citation Count: 23
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/337292.337548
What is a DOI?

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, a pre-locking mechanism and timing-aware terminal propagation are developed and integrated into the flow. The detailed placement step is formulated as a constrained quadratic program and solved efficiently. Results show improvements of 23.41% on average compared to another timingdriven placement system Timing-QUAD and significant improvements over Eisenmanns placement algorithm.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
T. S. Mob, T. S. Chang, and S.L.Hakimi. "Globally optimal floorplanning for a layout problem". IEEE Trans. on Circuit and Systems - I: Fundamental Theory and Applications, Vol.43:pp.713-720, Sep. 1996.
3
 
4
K. Wang and W.K. Chen. "Floorplan Area Optimization using Network Analogous Approach". In Proc. oflEEE International Symposium on Circuits and Systems, pages 167-170, 1995.
5
 
6
 
7

CITED BY  23

Collaborative Colleagues:
Shih-Lian Ou: colleagues
Massoud Pedram: colleagues