A skeleton for distributed work pools in Eden

Mischa Dieterle; Jost Berthold; Rita Loogen

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

A skeleton for distributed work pools in Eden

Mischa Dieterle, Jost Berthold, Rita Loogen

Department of Computer Science

6 Citations (Scopus)

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 demanddriven 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.

Original language	English
Title of host publication	Functional and Logic Programming : 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings
Editors	Matthias Blume, Naoki Kobayashi, Germán Vidal
Number of pages	17
Publisher	Springer
Publication date	2010
Pages	337-353
ISBN (Print)	978-3-642-12250-7
ISBN (Electronic)	978-3-642-12251-4
DOIs	https://doi.org/10.1007/978-3-642-12251-4_24
Publication status	Published - 2010
Event	10th International Symposium on Functional and Logic Programming - Sendai, Japan Duration: 19 Apr 2010 → 21 Apr 2010 Conference number: 10

Conference

Conference	10th International Symposium on Functional and Logic Programming
Number	10
Country/Territory	Japan
City	Sendai
Period	19/04/2010 → 21/04/2010

Series	Lecture notes in computer science
Volume	6009
ISSN	0302-9743

Access to Document

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

Cite this

Dieterle, M., Berthold, J., & Loogen, R. (2010). A skeleton for distributed work pools in Eden. In M. Blume, N. Kobayashi, & G. Vidal (Eds.), Functional and Logic Programming: 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings (pp. 337-353). Springer. Lecture notes in computer science Vol. 6009 https://doi.org/10.1007/978-3-642-12251-4_24

A skeleton for distributed work pools in Eden. / Dieterle, Mischa; Berthold, Jost; Loogen, Rita.

Functional and Logic Programming: 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings. ed. / Matthias Blume; Naoki Kobayashi; Germán Vidal. Springer, 2010. p. 337-353 (Lecture notes in computer science, Vol. 6009).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Dieterle, M, Berthold, J & Loogen, R 2010, A skeleton for distributed work pools in Eden. in M Blume, N Kobayashi & G Vidal (eds), Functional and Logic Programming: 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010. Proceedings. Springer, Lecture notes in computer science, vol. 6009, pp. 337-353, 10th International Symposium on Functional and Logic Programming, Sendai, Japan, 19/04/2010. https://doi.org/10.1007/978-3-642-12251-4_24

@inproceedings{405ad849132947d9814533201cfe1499,

title = "A skeleton for distributed work pools in Eden",

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 demanddriven 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.",

author = "Mischa Dieterle and Jost Berthold and Rita Loogen",

year = "2010",

doi = "10.1007/978-3-642-12251-4_24",

language = "English",

isbn = "978-3-642-12250-7",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "337--353",

editor = "Matthias Blume and Naoki Kobayashi and Germ{\'a}n Vidal",

booktitle = "Functional and Logic Programming",

note = "10th International Symposium on Functional and Logic Programming, FLOPS 2010 ; Conference date: 19-04-2010 Through 21-04-2010",

}

TY - GEN

T1 - A skeleton for distributed work pools in Eden

AU - Dieterle, Mischa

AU - Berthold, Jost

AU - Loogen, Rita

N1 - Conference code: 10

PY - 2010

Y1 - 2010

N2 - 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 demanddriven 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.

AB - 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 demanddriven 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.

U2 - 10.1007/978-3-642-12251-4_24

DO - 10.1007/978-3-642-12251-4_24

M3 - Article in proceedings

SN - 978-3-642-12250-7

T3 - Lecture notes in computer science

SP - 337

EP - 353

BT - Functional and Logic Programming

A2 - Blume, Matthias

A2 - Kobayashi, Naoki

A2 - Vidal, Germán

PB - Springer

T2 - 10th International Symposium on Functional and Logic Programming

Y2 - 19 April 2010 through 21 April 2010

ER -

A skeleton for distributed work pools in Eden

Abstract

Conference

Access to Document

Fingerprint

Cite this