Quick Matrix Multiplication on Clusters of Workstations

Authors:
Eyas El-Qawasmeh;Abdel-Elah Al-Ayyoub;Nayef Abu-Ghazaleh
Affiliations:
Computer Science Dept., Jordan University of Science and Technology, P.O. Box 3030, Irbid 22110, Jordan, e-mail: eyas@just.edu.jo;Information Technology and Computing, Arab Open University, P.O. Box 1339, Amman 11953, Jordan, e-mail: ayyoub@acm.org;Department of Computer Science, State University of New York at Binghamton, Binghamton, NY 13902-6000, e-mail: nayefag@hotmail.com
Venue:
Informatica
Year:
2004

Citing 10
Cited 1

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
PVM: a framework for parallel distributed computing

Concurrency: Practice and Experience
A high-performance matrix-multiplication algorithm on a distributed-memory parallel computer, using overlapped communication

IBM Journal of Research and Development
A three-dimensional approach to parallel matrix multiplication

IBM Journal of Research and Development
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
A Case for NOW (Networks of Workstations)

IEEE Micro
Efficient communication using total-exchange

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Design and Evaluation of an HPVM-Based Windows NT Supercomputer

International Journal of High Performance Computing Applications
Realistic Performance Prediction Tool for the Parallel Block LU Factorization Algorithm

Informatica

A Matrix-Based Model for Web Page Community Construction and More

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

A quick matrix multiplication algorithm is presented and evaluated on a cluster of networked workstations consisting of Pentium hosts connected together by Ethernet segments. The obtained results confirm the feasibility of using networked workstations to provide fast and low cost solutions to many computationally intensive applications such as large linear algebraic systems. The paper also presents and verifies an accurate timing model to predict the performance of the proposed algorithm on arbitrary clusters of workstations. Through this model the viability of the proposed algorithm can be revealed without the extra effort that would be needed to carry out real testing.