Blocked-Based Sparse Matrix-Vector Multiplication on Distributed Memory Parallel Computers
Journal: The International Arab Journal of Information Technology (Vol.8, No. 2)Publication Date: 2011-04-01
Authors : Rukhsana Shahnaz Anila Usman;
Page : 130-136
Keywords : Matrix-vector product; compressed storage formats; sparse matrix data structures; locality of matrix; parallel matrix computation; and block-based compressed storage;
Abstract
The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluster. Three storage formats for sparse matrices compressed row storage, block compressed row storage and sparse block compressed row storage are evaluated. Although using BCRS format reduces the execution time but the improvement may be limited because of the extra work from filled-in zeros. We show that the use of SBCRS not only improves the performance significantly but reduces matrix storage also
Other Latest Articles
- GUI Structural Metrics
- Hi-Tech Authentication for Palette Images Using Digital Signature and Data Hiding
- Feature Selection Method Based On Statistics of Compound Words for Arabic Text Classification
- Scheduling with Setup Time Matrix for Sequence Dependent Family
- Using Static and Dynamic Impact Analysis for Effort Estimation
Last modified: 2019-04-28 18:42:12