Performance properties of large scale parallel systems

Anshul Gupta, Vipin Kumar

Research output: Contribution to journalArticlepeer-review

Abstract

There are several metrics that characterize the performance of a parallel system, such as parallel execution time, speedup, and efficiency. A number of properties of these metrics have been studied. For example, it is a well known fact that given a parallel architecture and a problem of a fixed size, the speedup of a parallel algorithm does not continue to increase with increasing number of processors. It usually tends to saturate or peak at a certain limit. Thus, it may not be useful to employ more than an optimal number of processors for solving a problem on a parallel computer. This optimal number of processors depends on the problem size, the parallel algorithm, and the parallel architecture. In this paper we study the impact of parallel processing overheads and the degree of concurrency of a parallel algorithm on the optimal number of processors to be used when the criterion for optimality is minimization of the parallel execution time. We then study a more general criterion of optimality and show how operating at the optimal point is equivalent to operating at a unique value of efficiency that is characteristic of the criterion of optimality and the properties of the parallel system under study. We put the technical results derived in this paper in perspective with similar results that have appeared in the literature before and show how this paper generalizes and/or extends these earlier results.

Original languageEnglish (US)
Pages (from-to)234-244
Number of pages11
JournalJournal of Parallel and Distributed Computing
Volume19
Issue number3
DOIs
StatePublished - Nov 1993

Fingerprint

Dive into the research topics of 'Performance properties of large scale parallel systems'. Together they form a unique fingerprint.

Cite this