Abstract
The Recursive Sparse Blocks (RSB) is a sparse matrix layout designed for coarse grained parallelism and reduced cache misses when operating with matrices, which are larger than a computer’s cache. By laying out the matrix in sparse, non overlapping blocks, we allow for the shared memory parallel execution of transposed SParse Matrix-Vector multiply (SpMV), with higher efficiency than the traditional Compressed Sparse Rows (CSR) format. In this note we cover two issues. First, we propose two improvements to our original approach. Second, we look at the performance of standard and transposed shared memory parallel SpMV for unsymmetric matrices, using the proposed approach. We find that our implementation’s performance is competitive with that of both the highly optimized, proprietary Intel MKL Sparse BLAS library’s CSR routines, and the Compressed Sparse Blocks (CSB) research prototype.
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
Buluç, A., Fineman, J.T., Frigo, M., Gilbert, J.R., Leiserson, C.E.: Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. In: auf der Heide, F.M., Bender, M.A. (eds.) SPAA, pp. 233–244. ACM (2009)
Buluç, A., Gilbert, J.R.: On the Representation and Multiplication of Hypersparse Matrices. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008), pp. 1–11 (April 2008)
Martone, M., Filippone, S., Paprzycki, M., Tucci, S.: About the assembly of recursive sparse matrices. In: Proceedings of the International Multiconference on Computer Science and Information Technology, Wisła. Poland, pp. 317–325. IEEE Computer Society Press, Los Alamitos (2010)
Martone, M., Filippone, S., Paprzycki, M., Tucci, S.: On BLAS operations with recursively stored sparse matrices. In: Proceedings of the International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. Timisoara, Romania, pp. 49–56. IEEE (September 2010)
The University of Florida Sparse Matrix Collection, http://www.cise.ufl.edu/research/sparse/matrices
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martone, M., Paprzycki, M., Filippone, S. (2012). An Improved Sparse Matrix-Vector Multiply Based on Recursive Sparse Blocks Layout. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2011. Lecture Notes in Computer Science, vol 7116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29843-1_69
Download citation
DOI: https://doi.org/10.1007/978-3-642-29843-1_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29842-4
Online ISBN: 978-3-642-29843-1
eBook Packages: Computer ScienceComputer Science (R0)