ACM Home Page
Please provide us with feedback. Feedback
A novel net weighting algorithm for timing-driven placement
Full text PdfPdf (120 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California
Pages: 172 - 176  
Year of Publication: 2002
ISBN ~ ISSN:1092-3152 , 0-7803-7607-2
Author
Tim (Tianming) Kong  Aplus Design Technologies, Inc., Los Angeles, CA
Sponsors
: IEEE Circuits & Systems Society
IEEE-CS\DATC : IEEE Computer Society
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 52,   Citation Count: 23
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/774572.774597
What is a DOI?

ABSTRACT

Net weighting for timing-driven placement has been very popular in industry and academia. It has various advantages such as low complexity, high flexibility and ease of implementation. Existing net weighting algorithms, however, are often ad-hoc. There is generally no known good net weighting algorithms. In this paper, we present a novel net weighting algorithm based on the concept of path-counting, and apply it in timing-driven FPGA placement application. Theoretically this is the first ever known accurate, all-path counting algorithm. Experimental data shows that compared with the weighting algorithm used in state-of-the-art FPGA placement package VPR[1], this new algorithm can achieve the longest path delay reduction of up to 38.8%, 15.6% on average with no runtime overhead and only a 4.1% increase in total wirelength.


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
 
3
A. Srinivasan, K. Chaudhary, and E. S. Kuh, "RITUAL: Performance driven placement algorithm for small cell ICs," in IEEE/ACM International Conference on Computer-Aided Design, pp. 48--51, 1991.
4
 
5
6
 
7
M. Marek-Sadowska and S. P. Lin, "Timing driven placement," in IEEE/ACM International Conference on Computer-Aided Design, pp. 94--97, 1989.
 
8
B. M. Riess and G. G. Ettelt, "Speed: fast and efficient timing driven placement," in International Symposium on Circuits and Systems, pp. 377--380, 1995.
9
10
11
 
12
M. Senn, U. Seidl, and F. Johannes, "High quality deterministic timing driven FPGA placement," in ACM Symposium on FPGAs, 2002.
 
13

CITED BY  23
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Tim (Tianming) Kong: colleagues

Peer to Peer - Readers of this Article have also read: