Skeleton Implementations Based on Generic Data Distributions (2000)
| Venue: | 2nd Intern. Workshop on Constructive Methods for Parallel Programming (CMPP'2000 |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Nitsche00skeletonimplementations,
author = {Thomas Nitsche},
title = {Skeleton Implementations Based on Generic Data Distributions},
booktitle = {2nd Intern. Workshop on Constructive Methods for Parallel Programming (CMPP'2000},
year = {2000},
pages = {pages}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Data distribution algebras are an abstract notion for the description of parallel programs. In this paper we describe a generic implementation of data distributions (covers) which generalizes operations common to all data distributions and is parameterized by a description of the properties of the specific cover. Especially the communication and synchronization operations are realized in a generic way, such that every specific cover can specify the overlapping data in its implementation in a purely functional manner and rely on the general operations which internally generate the necessary communication schedule. This serves as the basis for arbitrary data distributions as well as for the implementation of general skeletons. As an example, we provide a skeletal implementation of the Wang algorithm.
