Data distributions for sparse matrix vector multiplication

Sparse matrix vector multiplication (SpMxV) is often one of the core components of many scientific applications. Many authors have proposed methods for its data distribution in distributed memory multiprocessors. We can classify these into four groups: Scatter, D-Way Strip, Recursive and Miscellaneo...

Full description

Saved in:
Bibliographic Details
Published in:Parallel computing Vol. 21; no. 4; pp. 583 - 605
Main Authors: Romero, L.F., Zapata, E.L.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.04.1995
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Data distribution
Distributed memory multiprocessor
Exact sciences and technology
Memory and file management (including protection and security)
Memory organisation. Data processing
Mesh topology
Parallel algorithm
Performance evaluation
Software
Software engineering
Sparse computation
Sparse matrix
Theoretical computing
Performance evaluation
Parallel algorithm
Data distribution
Sparse matrix
Mesh topology
Distributed memory multiprocessor
Sparse computation
Multiple recursive decomposition
Decomposition method
Sparse matrix vector multiplication
Matrix product
Distributed system
Topology
Generalization
Multiprocessor
Matrix calculus
Recursive method
ISSN:0167-8191, 1872-7336
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Sparse matrix vector multiplication (SpMxV) is often one of the core components of many scientific applications. Many authors have proposed methods for its data distribution in distributed memory multiprocessors. We can classify these into four groups: Scatter, D-Way Strip, Recursive and Miscellaneous. In this work we propose a new method (Multiple Recursive Decomposition (MRD)), which partitions the data using the prime factors of the dimensions of a multiprocessor network with mesh topology. Furthermore, we introduce a new storage scheme, storage-by-row-of-blocks, that significantly increases the efficiency of the Scatter method. We will name Block Row Scatter (BRS) method this new variant. The MRD and BRS methods achieve results that improve those obtained by other analyzed methods, being their implementation easier. In fact, the data distributions resulting from the MRD and BRS methods are a generalization of the Block and Cyclic distributions used in dense matrices.
ISSN:0167-8191
1872-7336
DOI:10.1016/0167-8191(94)00087-Q