Performance evaluation of storage formats for sparse matrices in fortran

Authors:
Anila Usman;Mikel Luján;Len Freeman;John R. Gurd
Affiliations:
Department of Computer & Information Sciences, PIEAS (Pakistan Institute of Engineering & Applied Science), Islamabad, Pakistan;Centre for Novel Computing, The University of Manchester, Manchester, United Kingdom;Centre for Novel Computing, The University of Manchester, Manchester, United Kingdom;Centre for Novel Computing, The University of Manchester, Manchester, United Kingdom
Venue:
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Year:
2006

Citing 7
Cited 1

Direct methods for sparse matrices

Direct methods for sparse matrices
A Survey of Indexing Techniques for Sparse Matrices

ACM Computing Surveys (CSUR)
An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum

ACM Transactions on Mathematical Software (TOMS)
Algorithm 818: A reference model implementation of the sparse BLAS in fortran 95

ACM Transactions on Mathematical Software (TOMS)
Data structures in Java for matrix computations: Research Articles

Concurrency and Computation: Practice & Experience
Sparsity: Optimization Framework for Sparse Matrix Kernels

International Journal of High Performance Computing Applications
Storage formats for sparse matrices in java

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I

Performance evaluation of sparse matrix products in UPC

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many storage formats have been proposed to represent spa- rse matrices. This paper extends to Fortran 95 the performance evaluation of sparse storage formats in Java presented at ICCS 2005, [7]. These experiments have the same set up (almost 200 sparse matrices and matrix-vector multiplication), but now consider the Fortran 95 Sparse BLAS reference implementation.