Stream Parallel Skeleton Optimization (1999)
| Venue: | in proceedings of the 11th IASTED International Conference on Parallel and Distributed Computing and Systems, MIT |
| Citations: | 14 - 12 self |
BibTeX
@INPROCEEDINGS{Aldinucci99streamparallel,
author = {Marco Aldinucci and Marco Danelutto},
title = {Stream Parallel Skeleton Optimization},
booktitle = {in proceedings of the 11th IASTED International Conference on Parallel and Distributed Computing and Systems, MIT},
year = {1999},
pages = {955--962},
publisher = {IASTED/ACTA press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We discuss the properties of the composition of stream parallel skeletons such as pipelines and farms. By looking at the ideal performance gures assumed to hold for these skeletons, we show that any stream parallel skeleton composition can always be rewritten into an equivalent \normal form" skeleton composition, delivering a service time which is equal or even better to the service time of the original skeleton composition, and achieving a better utilization of the processors used. The normal form is dened as a single farm built around a sequential worker code. Experimental results are discussed that validate this normal form. Keywords: skeletons, rewriting, stream parallelism. 1 Introduction Skeleton based programming models represent an interesting subject in the eld of parallel programming models. Cole introduced the skeleton concept in the late 80's [1]. Cole's skeletons represented parallelism exploitation patterns that can be used (instantiated) to model common parallel ap...
