Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A methodology for the performance prediction of massively parallel applications

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)
Menasce, D. ; Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; Noh, S.H. ; Tripathi, S.K.

This paper presents a methodology to predict the execution time of massively parallel applications before any significant implementation actions are taken. This methodology captures the problem decomposition into tasks and their precedence relationship, along with the computational and communication demands placed by the application on the underlying architecture. An example shows how the methodology may be used to study the effects of various data placement strategies, problem size, and number of processors for an LU factorization algorithm. The model predictions were validated with published experimental results on a Touchstone Delta machine

Published in:

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Date of Conference:

1-4 Dec 1993