By Topic

An analytic performance model of parallel systems that perform N tasks using P processors that can fail

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)
Weerasinghe, G. ; Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA ; Antonios, I. ; Lipsky, L.

We present a Markov model for analyzing the performance of parallel/distributed processors that execute a job consisting of N independent tasks in parallel using P processors. The model is a Markov chain with states representing service and failure rates with k (0<k⩽P) active processors. The task-times and processor failures are both exponentially distributed. We derive a number of expressions to determine the mean execution time, probability of success, work, and other measurable quantities, all conditioned on the job finishing successfully. A prototype, implemented using an extended version of ACMPI, is used for actual experiments that are based on simulated task-times and processor failures. We present our results comparing the analytic model with the prototype for a range of values of processor failure rates. We also discuss extensions of the model and issues related to communication costs, approximations and effect of task-time distributions

Published in:

Network Computing and Applications, 2001. NCA 2001. IEEE International Symposium on

Date of Conference:

2001