A Scheme For Nesting Algorithmic Skeletons (1998)
| Venue: | Department of Computer Science, University College London |
| Citations: | 3 - 1 self |
BibTeX
@INPROCEEDINGS{Hamdan98ascheme,
author = {Mohammad Hamdan and Greg Michaelson and Peter King},
title = {A Scheme For Nesting Algorithmic Skeletons},
booktitle = {Department of Computer Science, University College London},
year = {1998},
pages = {195--211}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. A scheme for arbitrary nesting of algorithmic skeletons is explained which is based on the idea of groups in MPI. Two skeletons were developed which run in a nested mode: a binary divide and conquer and a process farm for a parallel implementation of fold and map HOFs respectively. An Example showing various cases for nesting the two skeletons is presented. The experiment was conducted on the Fujitsu AP1000 parallel machine. 1 Introduction It is well known that parallelism adds an additional level of difficulty to software development. Following Cole's characterisation[1], algorithmic skeletons have been recognised widely as a valuable basis for parallel software construction. A skeleton abstracts a control structure which may be instantiated subsequently with specific functions to carry out specific tasks. Therefore, the encapsulation of parallel algorithms into skeletons is a promising approach to high-level specification of parallel algorithms. Normally, functional programming la...
