Abstract
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V) 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 variable-sized register blocking format.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mellor-Crummey, J., Garvin, J.: Optimizing sparse matrix vector product computations using unroll and jam. International Journal of High Performance Computing Applications 18(2), 225–236 (2004)
Vuduc, R., Demmel, J.W., Yelick, K.A., Kamil, S., Nishtala, R., Lee, B.: Performance optimizations and bounds for sparse matrix-vector multiply. In: Proceedings of Supercomputing 2002, Baltimore, MD, USA (November 2002)
Nehéz, M.: On Geometrical Properties of Random Tori and Random Graph Models. Journal of Electrical Engineering 51(12/s), 59–62 (2000)
Im, E.: Optimizing the Performance of Sparse Matrix-Vector Multiplication. Dissertation thesis, University of Carolina at Berkeley (2001)
Tvrdík, P., Šimeček, I.: A new diagonal blocking format and model of cache behavior for sparse matrices. Proceedings of Parallel Processing and Applied Mathematics 12(4), 617–629 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Šimeček, I., Tvrdík, P. (2008). Sparse Matrix-Vector Multiplication - Final Solution?. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-68111-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68105-2
Online ISBN: 978-3-540-68111-3
eBook Packages: Computer ScienceComputer Science (R0)