DocumentCode
1990184
Title
Structured parallel programming
Author
Darlington, J. ; Ghanem, M. ; To, H.W.
Author_Institution
Dept. of Comput., Imperial Coll. of Sci., Technol. & Med., London, UK
fYear
1993
fDate
20-23 Sep 1993
Firstpage
160
Lastpage
169
Abstract
Parallel programming is a difficult task involving many complex issues such as resource allocation, and process coordination. We propose a solution to this problem based on the use of a repertoire of parallel algorithmic forms, known as skeletons. The use of skeletons enables the meaning of a parallel program to be separated from its behaviour. Central to this methodology is the use of transformations and performance models. Transformations provide portability and implementation choices, whilst performance models guide the choices by providing predictions of execution time. We describe the methodology and investigate the use and construction of performance models by studying an example
Keywords
parallel algorithms; parallel programming; resource allocation; structured programming; implementation choices; parallel algorithmic forms; performance models; portability; process coordination; resource allocation; skeletons; structured parallel programming; transformations; Degradation; Parallel machines; Parallel programming; Predictive models; Prototypes; Skeleton; Tires;
fLanguage
English
Publisher
ieee
Conference_Titel
Programming Models for Massively Parallel Computers, 1993. Proceedings
Conference_Location
Berlin
Print_ISBN
0-8186-4900-3
Type
conf
DOI
10.1109/PMMP.1993.315543
Filename
315543
Link To Document