87 search results - page 1 / 18 » Optimizing Sparse Data Structures for Matrix-vector Multiply |
AAECC
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
CONCURRENCY
1998
13 years 5 months ago
1998
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The innovation of this work is a simple vectorizable algorithm for performing sparse matrix vector multiply in compressed sparse row (CSR) storage format. Unlike the vect...
HPCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...
PARLE
1994
13 years 8 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...