Implementation skeletons in Eden: low-effort parallel programming (Q2763379)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1691457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementation skeletons in Eden: low-effort parallel programming |
scientific article; zbMATH DE number 1691457 |
Statements
15 January 2002
0 references
0.9031984210014344
0 references
0.8656210899353027
0 references
0.8465520739555359
0 references
0.7970895767211914
0 references
Implementation skeletons in Eden: low-effort parallel programming (English)
0 references
\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].
0 references