The RAW benchmark suite: computation structures for general purpose computing

  • Authors:
  • J. Babb;M. Frank;V. Lee;E. Waingold;R. Barua;M. Taylor;J. Kim;S. Devabhaktuni;A. Agarwal

  • Affiliations:
  • -;-;-;-;-;-;-;-;-

  • Venue:
  • FCCM '97 Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines
  • Year:
  • 1997

Quantified Score

Hi-index 0.01

Visualization

Abstract

The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut of algorithms found in general purpose computing, including sorting, matrix operations, and graph algorithms. The suite includes an architecture-independent compilation framework, Raw Computation Structures (RawCS), to express each algorithm's dependencies and to support automatic synthesis, partitioning, and mapping to a reconfigurable computer. Within this framework, each benchmark is portably designed in both C and Behavioral Verilog and scalably parameterized to consume a range of hardware resource capacities. To establish initial benchmark ratings, we have targeted a commercial logic emulation system based on virtual wires technology to automatically generate designs up to millions of gates (14 to 379 FPGAs). Because the virtual wires techniques abstract away machine-level details like FPGA capacity and interconnect, our hardware target for this system is an abstract reconfigurable logic fabric with memory-mapped host I/O. We report initial speeds in the range of 2X to 1800X faster than a 2.82 SPECint95 SparcStation 20 and encourage others in the field to run these benchmarks on other systems to provide a standard comparison.