Abstract
The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applications. This kernel is an irregular problem, which has led to the development of several compressed storage formats such as CRS, CCS, and JDS among others. We propose an alternative storage format, the Transpose Jagged Diagonal Storage(TJDS), which is inspired from the Jagged Diagonal Storage format and makes no assumptions about the sparsity pattern of the matrix. We present a selection of sparse matrices and compare the storage requirements needed using JDS and TJDS formats, and we show that the TDJS format needs less storage space than the JDS format because the permutation array is not required. Another advantage of the proposed format is that although TJDS also suffers the drawback of indirect addressing, it does not need the permutation step after the computation of the SMVP.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dongarra, J.: Sparse Matrix Storage Formats. In: Bai, Z., et al. (eds.) Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia (2000), Electronic version available at, http://www.cs.utk.edu/~dongarra/etemplates/node372.html
Matrix Market, the electronic version is available at the following, http://math.nist.gov/MatrixMarket/
Saad, Y.: Krylov Subspace methods on Supercomputers. Siam J. Sci. Stat. Comp. 10(6), 1200–1232 (1989)
Saad, Y.: SPARSKIT: A basic tool kit for sparse matrix computations Report RIACS-90-20. Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA (1990)
Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS publishing company, Boston (1996)
Montagne, E., Ekambaram, A.: An Optimal Storage Format for Sparse Matrices (December 2002) (submitted for publication)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ekambaram, A., Montagne, E. (2003). An Alternative Compressed Storage Format for Sparse Matrices. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-39737-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20409-1
Online ISBN: 978-3-540-39737-3
eBook Packages: Springer Book Archive