A Scheme for Nesting Algorithmic Skeletons
نویسندگان
چکیده
A scheme for arbitrary nesting of algorithmic skeletons is explained which is based on the idea of groups in MPI. The scheme is part of a semi-automatic compilation system which generates parallel code for nested HOFs. 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. Examples showing various cases for nesting the two skeletons are presented. The experiments were conducted on the Fujitsu AP1000 parallel machine.
منابع مشابه
Parallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملA framework for nesting algorithmic skeletons
We propose a framework for compiling and executing arbitrary depth algorithmic skeleton nesting. It consists of translation rules (schemes) to be used at compile-time for the static-analysis of the source program and at run-time to execute nested skeletons in parallel. We report results for deeply nested programs for diierent platforms.
متن کاملDistributed Applications Implemented in Maude with Parameterized Skeletons
Algorithmic skeletons are a well-known approach for implementing parallel and distributed applications. Declarative versions typically use higher-order functions in functional languages. We show here a different approach based on object-oriented parameterized modules in Maude, that receive the operations needed to solve a concrete problem as a parameter. Architectures are conceived separately f...
متن کاملHierarchical Master-Worker Skeletons
Master-worker systems are a well-known and often applicable scheme for the parallel evaluation of a pool of tasks, a work pool. The system consists of a master process managing a set of worker processes. After an initial phase with a fixed amount of tasks for each worker, further tasks are distributed in reply to results sent back by the workers. As this setup quickly leads to a bottleneck in t...
متن کامل