A 7-step approach to the design and implementation of parallel algorithms

Authors:
Thomas F. Steck;Gerard G. L. Meyer
Affiliations:
Electrical and Computer Engineering, Johns Hopkins University, Baltimore, MD;Electrical and Computer Engineering, Johns Hopkins University, Baltimore, MD
Venue:
MATH'05 Proceedings of the 7th WSEAS International Conference on Applied Mathematics
Year:
2005

Citing 4
Cited 0

The use of BLAS3 in linear algebra on a parallel processor with a hierarchical memory

SIAM Journal on Scientific and Statistical Computing
Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a 7-step, semi-systematic approach for designing and implementing parallel algorithms. In this paper, the target implementation uses MPI for message passing. The approach is applied to a family of matrix factorization algorithms- LU, QR, and Cholesky - which share a common structure, namely, that the second factor of each is upper right triangular. The efficacy of the approach is demonstrated by implementing, tuning, and timing execution on two commercially available multiprocessor computers.