Sciweavers

87 search results - page 2 / 18
» Optimizing Sparse Data Structures for Matrix-vector Multiply
Sort
View
FCCM
2007
IEEE
165views VLSI» more  FCCM 2007»
14 years 11 months ago
Sparse Matrix-Vector Multiplication Design on FPGAs
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
Junqing Sun, Gregory D. Peterson, Olaf O. Storaasl...
ICPP
2009
IEEE
15 years 4 months ago
Perfomance Models for Blocked Sparse Matrix-Vector Multiplication Kernels
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...
ICPP
2008
IEEE
15 years 3 months ago
Improving the Performance of Multithreaded Sparse Matrix-Vector Multiplication Using Index and Value Compression
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
Kornilios Kourtis, Georgios I. Goumas, Nectarios K...
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
15 years 2 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 sig...
Ling Zhuo, Viktor K. Prasanna
57
Voted
IJHPCA
2011
80views more  IJHPCA 2011»
14 years 4 months ago
Optimizing Sparse Data Structures for Matrix-vector Multiply
D. Guo, William Gropp