Skil: An imperative language with algorithmic skeletons for efficient distributed programming
Conference
·
OSTI ID:421367
- Aachen Univ. of Technology (Germany)
In this paper we present Skil, an imperative language enhanced with higher-order functions and currying, as well as with a polymorphic type system. The high level of Skil allows the integration of algorithmic skeletons, i.e. of higher-order functions representing parallel computation patterns. At the same time, the language can be efficiently implemented. After describing a series of skeletons which work with distributed arrays, we give two examples of parallel programs implemented on the basis of skeletons, namely shortest paths in graphs and Gaussian elimination. Runtime measurements show that we approach the efficiency of message-passing C up to a factor between 1 and 2.5.
- OSTI ID:
- 421367
- Report Number(s):
- CONF-960835--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Runtime Scheduling Policies for Distributed Graph Algorithms
Runtime Scheduling Policies for Distributed Graph Algorithms
A supernodal all-pairs shortest path algorithm
Conference
·
Mon Aug 06 00:00:00 EDT 2018
·
OSTI ID:1526308
Runtime Scheduling Policies for Distributed Graph Algorithms
Conference
·
Wed Jun 06 00:00:00 EDT 2018
·
OSTI ID:1862915
A supernodal all-pairs shortest path algorithm
Conference
·
Fri Jan 31 23:00:00 EST 2020
·
OSTI ID:1648874