Post-placement C-slow retiming for the xilinx virtex FPGA

Authors:
Nicholas Weaver;Yury Markovskiy;Yatish Patel;John Wawrzynek
Affiliations:
UC Berkeley, Berkeley, CA;UC Berkeley, Berkeley, CA;UC Berkeley, Berkeley, CA;UC Berkeley, Berkeley, CA
Venue:
FPGA '03 Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays
Year:
2003

Citing 6
Cited 5

Interleaving: a multithreading technique targeting multiprocessors and workstations

ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
Simultaneous multithreading: maximizing on-chip parallelism

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
The Tera computer system

ICS '90 Proceedings of the 4th international conference on Supercomputing
Optimal FPGA mapping and retiming with efficient initial state computation

DAC '98 Proceedings of the 35th annual Design Automation Conference
HSRA: high-speed, hierarchical synchronous reconfigurable array

FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
Integrated retiming and placement for field programmable gate arrays

FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays

The SFRA: a corner-turn FPGA architecture

FPGA '04 Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
Exploring Reconfigurable Architectures for Binomial-Tree Pricing Models

ARC '08 Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation

Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Exploring Reconfigurable Architectures for Tree-Based Option Pricing Models

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Hardware framework for the rabbit stream cipher

Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology

Quantified Score

Hi-index	0.00

Visualization

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.