Performance prediction modeling of multicomputers

Author

Sreekantaswamy, H.V. ; Chanson, S. ; Wagner, A.

Author_Institution

Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada

fYear

1992

fDate

9-12 Jun 1992

Firstpage

278

Lastpage

285

Abstract

An efficient execution model for tree structured computations is presented. A general framework for analyzing the performance of this type of computation for any given topology is discussed. The framework is used to derive models for two widely used parallel programming strategies: processor farms and divide and conquer. The models were validated on a large multicomputer, and it was shown that their accuracy is such that they can be used to predict the performance of applications that use the above strategies. The use of these models to evaluate performance and to restructure the application to improve performance is discussed

Keywords

multiprocessing systems; parallel programming; performance evaluation; divide and conquer; execution model; multicomputers; parallel programming; performance prediction modelling; processor farms; tree structured computations; Application software; Computer science; Costs; Hardware; Microprocessors; Parallel processing; Parallel programming; Performance analysis; Predictive models; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on

Conference_Location

Yokohama

Print_ISBN

0-8186-2865-0

Type

conf

DOI

10.1109/ICDCS.1992.235030

Filename

235030