A skeleton for distributed work pools in eden

Authors:
Mischa Dieterle;Jost Berthold;Rita Loogen
Affiliations:
Philipps-Universität Marburg, Fachbereich Mathematik und Informatik, Marburg, Germany;Datalogisk Institut, University of Copenhagen, Denmark;Philipps-Universität Marburg, Fachbereich Mathematik und Informatik, Marburg, Germany
Venue:
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Year:
2010

Citing 6
Cited 3

Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering

Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Parallel functional programming in Eden

Journal of Functional Programming
Performance Analysis of Branch-and-Bound Skeletons

PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
Task Pool Teams: a hybrid programming environment for irregular algorithms on SMP clusters: Research Articles

Concurrency and Computation: Practice & Experience
Parallel Programming in C with MPI and OpenMP

Parallel Programming in C with MPI and OpenMP
Hierarchical master-worker skeletons

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages

A survey of algorithmic skeleton frameworks: high-level structured parallel programming enablers

Software—Practice & Experience - Focus on Selected PhD Literature Reviews in the Practical Aspects of Software Technology
Parallel computation skeletons with premature termination property

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Eden --- parallel functional programming with haskell

CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a flexible skeleton for implementing distributed work pools in our parallel functional language Eden. The skeleton manages a pool of tasks (work pool) in a distributed manner using a demand-driven work stealing approach for load balancing. All coordination is done locally within the worker processes. The latter are arranged in a ring topology and exchange additional channels to shortcut communication paths. The skeleton is suited for different types of algorithms, namely simple data parallel ones and standard tree search algorithms like backtracking, and using a global state as needed for branch-and-bound. Runtime experiments reveal a stable runtime behaviour for the different algorithm classes as illustrated by activity profiles (timeline diagrams). Acceptable speedups can be achieved with low effort.