A New Format for sparse Matrix-vector Multiplication
Author: Ivan Šimeček

High-performance, sparse matrix-vector multiplication, register blocking format.


Algorithms for the sparse matrix-vector multiplication (shortly SpMV) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the memory access patterns are irregular and the utilization of a cache suffers from low spatial and temporal locality. To reduce this effect, the register blocking formats were designed. This paper introduces a new combined format, for storing sparse matrices that extends possibilities of the diagonal register blocking format.


final version (in .PDF format)

BibTex entry:
author = {{\v S}ime{\v c}ek, I.},
title = {A New Format for sparse Matrix-vector Multiplication},
booktitle = {Seminar on Numerical Analysis},
publisher = {{\' U}stav geonomy AV {\v C}R},
address = {Ostrava},
year = {2007},
pages = {101--104},
ISBN = {80-86407-12-8},
language = {English}