A Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication

Authors:
Ming-Chang Lee
Affiliations:
Department of Information Management, Fooyin University, Kaohsiung, Taiwan
Venue:
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Year:
2009

Citing 5
Cited 0

PVM: a framework for parallel distributed computing

Concurrency: Practice and Experience
Network-based concurrent computing on the PVM system

Concurrency: Practice and Experience
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A Fast Algorithm for Matrix Multiplication and Its Efficient Realization on Systolic Arrays

Cybernetics and Systems Analysis
Impact of mixed-parallelism on parallel implementations of the Strassen and Winograd matrix multiplication algorithms: Research Articles

Concurrency and Computation: Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with parallels of the fast matrix multiplication strassen's algorithm, winograd's algorithm and analyzes empirical study of the matrix multiplication under the distributed environment in which PVM (Parallel Virtual Machine) environment is implemented. The contribution of this paper is that the parallelism of matrix-matrix multiplication need personal computer (or workstation cluster), which is not supercomputer. Firstly, we represent standard, strassen and winograd algorithm for matrix-matrix multiplication. Secondly, we develop a parallel implementation with master- slave processor. Thirdly, the efficiency of the proposed implementations is evaluated by using PVM.