By Topic

Prediction of parallel algorithms performance on bus-based networks using PVM

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rodriguez, R.J. ; Univ. de La Laguna, Tenerife ; Almeida, C. ; Morales, D.

We adapt the classic sequential model used to predict the performance of communications on parallel computers to a local area network using PVM. We have discovered that the linear model using the values of the parameters (latency, transfer rate) given by the “ping-pong” algorithm does not predict correctly the times invested in several communication patterns. This work concentrates in one of these patterns: One to All communications. We propose an alternative experiment that takes into account the overlapping between computations and communications that arises for this pattern. We illustrate the problem and its solution using a parallel matrix multiplication algorithm based on the master-slave paradigm. The detection of this phenomenon and the determination of the new values far the parameters simplify the design of parallel algorithms and can be used to predict the appropriate number of processors to achieve maximum efficiency

Published in:

Parallel and Distributed Processing, 1998. PDP '98. Proceedings of the Sixth Euromicro Workshop on

Date of Conference:

21-23 Jan 1998