A methodology for performance analysis of parallel computations with looping constructs

Abstract This paper describes a novel modeling methodology for evaluating the execution of parallel programs containing looping constructs. Our approach employs analytic methods to obtain an estimate of the average execution time of such a program in a distributed, multiple-computer environment. These tools are based on an amalgamation of queuing network theory (used to model physical system characteristics) and graph models of program behavior. To evaluate a complex program, we first decompose it into a number of program segments with “simpler” structures; then analyze each segment independently; and, finally, combine individual results to produce an approximate solution for the whole program. A realistic example is used to illustrate the application of this performance evaluation methodology.