Implementation skeletons in Eden: low-effort parallel programming
\textit{Algorithmic skeletons} define general patterns of computation which are useful for exposing the computational structure of a program. Being general structures they qualify as a target for parallelisation, which is most often carried out by providing specialised, non-portable, low-level parallel implementations (\textit{architectural skeletons}) of each algorithmic skeleton for different platforms. In the paper we introduce an intermediate layer of \textit{implementation skeletons} for the parallel functional language Eden. These are portable high-level skeletons which simplify the design of parallel programs substantially. Runtime experiments on a network of workstations and on a Beowulf cluster have shown that even on such \textit{high-latency} parallel platforms good speedups can be obtained. For the entire collection see [Zbl 0977.68824].
- Efficient high-level parallel programming
- NESTED ALGORITHMIC SKELETONS FROM HIGHER ORDER FUNCTIONS
- Implementing data parallel rational multiple-residue arithmetic in Eden
- Parallelism abstractions in Eden
- Sized types for typing Eden skeletons
- scientific article; zbMATH DE number 2102051 (Why is no real title available?)
- scientific article; zbMATH DE number 2102058 (Why is no real title available?)
- Implementation of Functional Languages
- Parallel functional programming in Eden
- Skeleton-based parallel programming: functional and parallel semantics in a single shot
This page was built for publication: Implementation skeletons in Eden: low-effort parallel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763379)
