IEEJ Transactions on Electronics, Information and Systems
Online ISSN : 1348-8155
Print ISSN : 0385-4221
ISSN-L : 0385-4221
<Software and Information Processing>
A Practical Performance Comparison of Parallel Matrix Multiplication Algorithms on Network of Workstations
Kalim Qureshi, Haroon Rashid
Author information
Keywords: Parallel algorithms, Load balancing, matrix multiplication, performance analysis, cluster parallel computing
JOURNAL FREE ACCESS

2005 Volume 125 Issue 4 Pages 677-678

[Correction] IEEJ Trans. EIS Vol.125 (2005) No.5 p.E5
Details
Download PDF (2351K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract

In this paper we practically compared the performance of three blocked based parallel multiplication algorithms with simple fixed size runtime task scheduling strategy on homogeneous cluster of workstations. Parallel Virtual Machine (PVM) was used for this study.

Content from these authors
© 2005 by the Institute of Electrical Engineers of Japan
Previous article Next article
Favorites & Alerts

Recently viewed articles
Announcements from publisher
  • A member of IEEJ can access the transactions of the Technical Society to which the member belongs. Please enter the My Page login ID in the subscriber number column and the birth date (year/month/date with one-byte characters: for example, 19800303) in the password column.
Predecessor

The transactions of the Institute of Electrical Engineers of Japan.C

The Journal of the Institute of Electrical Engineers of Japan

Related information

https://www.jstage.jst.go.jp/browse

Related journals
The Journal of The Institute of Electrical Engineers of Japan
IEEJ Transactions on Fundamentals and Materials
IEEJ Transactions on Power and Energy
IEEJ Transactions on Industry Applications
IEEJ Journal of Industry Applications
IEEJ Transactions on Sensors and Micromachines
IEEJ Transactions on Electrical and Electronic Engineering
Share this page
feedback
 Top