ACM Home Page
Please provide us with feedback. Feedback
Post-placement C-slow retiming for the xilinx virtex FPGA
Full text PdfPdf (223 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays table of contents
Monterey, California, USA
SESSION: Architecture analysis and automation table of contents
Pages: 185 - 194  
Year of Publication: 2003
ISBN:1-58113-651-X
Authors
Nicholas Weaver  UC Berkeley, Berkeley, CA
Yury Markovskiy  UC Berkeley, Berkeley, CA
Yatish Patel  UC Berkeley, Berkeley, CA
John Wawrzynek  UC Berkeley, Berkeley, CA
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 31,   Citation Count: 1
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/611817.611845
What is a DOI?

ABSTRACT

C-slow retiming is a process of automatically increasing the throughput of a design by enabling fine grained pipelining of problems with feedback loops. This transformation is especially appropriate when applied to FPGA designs because of the large number of available registers. To demonstrate and evaluate the benefits of C-slow retiming, we constructed an automatic tool which modifies designs targeting the Xilinx Virtex family of FPGAs. Applying our tool to three benchmarks: AES encryption, Smith/Waterman sequence matching, and the LEON 1 synthesized microprocessor core, we were able to substantially increase the total throughput. For some parameters, throughput is effectively doubled.


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
J. Cong and C. Wu. An improved algorithm for performance optimal technology mapping with retiming in LUT-based FPGA design. pages 572--578.
3
 
4
J. Gaisler. Leon sparc-compatable processor.
 
5
Intel. Intel hyper-threading technology, 2001. http://developer.intel.com/technology/hyperthread/.
6
 
7
C. Leiserson, F. Rose, and J. Saxe. Optimizing synchronous circuitry by retiming. In Third Caltech Conference On VLSI, March 1993.
 
8
NIST. Federal information processing standards publication 197: Advanced encryption standard, 2001. http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf.
 
9
NIST. Recommendations for block cypher modes of operation, nist special publication 800-38a, 2001. http://csrc.nist.gov/publications/nistpubs/800-38a/sp800-38a.pdf.
10
 
11
B. J. Smith. Architecture and application of the hep multiprocessor computer system. In SPIE, pages 298:241--248, 1981.
 
12
T. Smith and M. Waterman. Identification of common molecular subsecquences, 1981.
 
13
Synopsys. Synopsys fpga compiler.
 
14
Synplify. Synplify fpga synthesis solution.
15
16
 
17
Xilinx, Inc., 2100 Logic Drive, San Jose, CA 95124. Virtex Series FPGAs, 1999.
 
18
Xilinx, Inc., 2100 Logic Drive, San Jose, CA 95124. Virtex Series FPGAs, 1999.


Collaborative Colleagues:
Nicholas Weaver: colleagues
Yury Markovskiy: colleagues
Yatish Patel: colleagues
John Wawrzynek: colleagues