A Skeleton for Distributed Work Pools in Eden

  • Mischa Dieterle
  • Jost Berthold
  • Rita Loogen
Conference paper

DOI: 10.1007/978-3-642-12251-4_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6009)
Cite this paper as:
Dieterle M., Berthold J., Loogen R. (2010) A Skeleton for Distributed Work Pools in Eden. In: Blume M., Kobayashi N., Vidal G. (eds) Functional and Logic Programming. FLOPS 2010. Lecture Notes in Computer Science, vol 6009. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Mischa Dieterle
    • 1
  • Jost Berthold
    • 2
  • Rita Loogen
    • 1
  1. 1.Philipps-Universität MarburgFachbereich Mathematik und InformatikMarburgGermany
  2. 2.Datalogisk InstitutUniversity of CopenhagenDenmark

Personalised recommendations