Sciweavers

Share
FPGA
2005
ACM

Sparse Matrix-Vector multiplication on FPGAs

10 years 8 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices significantly reduces the performance of SpMXV on general-purpose processors, which rely heavily on the cache hierarchy to achieve high performance. The abundant hardware resources on current FPGAs provide new opportunities to improve the performance of SpMXV. In this paper, we propose an FPGA-based design for SpMXV. Our design accepts sparse matrices in Compressed Row Storage format, and makes no assumptions about the sparsity structure of the input matrix. The design employs IEEE-754 format double-precision floating-point multipliers/adders, and performs multiple floatingpoint operations as well as I/O operations in parallel. The performance of our design for SpMXV is evaluated using various sparse matrices from the scientific computing community, with the Xilinx Virtex-II Pro XC2VP70 as the target device....
Ling Zhuo, Viktor K. Prasanna
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where FPGA
Authors Ling Zhuo, Viktor K. Prasanna
Comments (0)
books