Treffer: Evaluation of parallel programs by measurement of its granularity

Title:
Evaluation of parallel programs by measurement of its granularity
Authors:
Source:
PPAM 2001 : parallel processing and applied mathematics (Naleczow, 9-12 September 2001, revised papers)Lecture notes in computer science. :145-153
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Science Department, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370 Wroclaw, Poland
ISSN:
0302-9743
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14511962
Database:
PASCAL Archive

Weitere Informationen

In the past years computing has been moving from the sequential world to the parallel one, from centralised organisation to a decentralised. In parallel programming the goal of the design process cannot be reduced to optimise a single metrics like for example speed. While evaluating a parallel program a problem specific function of execution time, memory requirements, communication cost, implementation cost, and others have to be taken into consideration. The paper deals with the use of an idea of program granularity in the evaluation of parallel programs. The obtained results suggest that the presented method can be used for performance evaluation of parallel programs.