By Topic

Performance Evaluation of Sparse Storage Formats

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Usman, A. ; Pakistan Institute of Engineering & Applied Sciences, Nilore, Islamabad, Pakistan, ani1a@pieas.edu.pk ; Lujan, M. ; Freeman, L.

Sparse matrices are pervasive in many Computational Science and Engineering (CS&E) applications. There is a significant number of storage formats used to represent sparse matrices. This paper presents a performance evaluation of storage formats for the main kernel of iterative methods for numerical linear algebra, namely matrix-vector multiplication. The experiments consider a set of almost 200 sparse matrices from the Matrix Market collection covering both systems of linear equations and eigenvalue problems. For each matrix, the experiments perform the matrix-vector multiplication with most commonly used sparse storage formats and also the recently proposed Java Sparse Array storage fonmat. To the best of the authors' knowledge, there is no other performance evaluation of storage formats for sparse matrices which consider such a variety of matrices and storage formats.

Published in:

Information and Communication Technologies, 2005. ICICT 2005. First International Conference on

Date of Conference:

27-28 Aug. 2005