ACM Home Page
Please provide us with feedback. Feedback
Timing optimization of FPGA placements by logic replication
Full text PdfPdf (204 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 40th annual Design Automation Conference table of contents
Anaheim, CA, USA
SESSION: Timing-oriented placement table of contents
Pages: 196 - 201  
Year of Publication: 2003
ISBN:1-58113-688-9
Authors
Giancarlo Beraudo  University of Illinois at Chicago, Chicago IL
John Lillis  University of Illinois at Chicago, Chicago IL
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Citation Count: 15
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/775832.775885
What is a DOI?

ABSTRACT

Logic replication for placement level timing optimization is studied in the context of FPGAs. We make the observation that critical paths are dominated by interconnect delay and are frequently highly circuitous. We propose a systematic replication technique to "straighten" such paths. The resulting algorithm has several components: cell selection, slot selection for a duplicate cell, fanout partitioning and placement legalization. This algorithm is described and promising preliminary experimental results are reported with up to 29% improvement in critical path delay.


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
L.T. Liu, M.T. Kuo, C.K. Cheng, and T.C. Hu. A Replication Cut for Two-Way Partitioning, IEEE Trans. on CAD, 1995
 
2
 
3
W. K. Mak and D. F. Wong. Minimum replication min-cut partitioning. IEEE Transactions on CAD,. October 1997
 
4
C. Kring and A. Newton. A cell-Replicating Approach to Mincut-Based Circuit Partitioning. ICCAD 1991
 
5
 
6
J. Lillis, C.-K. Cheng, T.-T. Y. Lin. Algorithms for Optimal Introduction of Redundant Logic for Timing and Area Optimization. Proc. IEEE International Symposium on Circuits and Systems, 1996
 
7
 
8
9
10
 
11
 
12

CITED BY  16

Collaborative Colleagues:
Giancarlo Beraudo: colleagues
John Lillis: colleagues