2003
DOI: 10.1007/978-3-540-45209-6_102
|View full text |Cite
|
Sign up to set email alerts
|

High-Level Process Control in Eden

Abstract: Abstract. High-level control of parallel process behaviour simplifies the development of parallel software substantially by freeing the programmer from low-level process management and coordination details. The latter are handled by a sophisticated runtime system which controls program execution. In this paper we look behind the scenes and show how the enormous gap between high-level parallel language constructs and their low-level implementation has been bridged in the implementation of the parallel functiona… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2004
2004
2016
2016

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…It has subsequently seen several complete rewrites and major revisions. Some parts of the implementation which were originally implemented directly in the runtime system have now been lifted to the Haskell level, relying on simpler and more modular runtime system support (Berthold et al, 2003). This refinement ultimately led to factoring out the EdI language: all Eden language constructs are now implemented in Haskell, using the simpler primitive operations that implement EdI directly (Berthold & Loogen, 2007;Berthold, 2008).…”
Section: Implementations Of Gph and Edenmentioning
confidence: 99%
“…It has subsequently seen several complete rewrites and major revisions. Some parts of the implementation which were originally implemented directly in the runtime system have now been lifted to the Haskell level, relying on simpler and more modular runtime system support (Berthold et al, 2003). This refinement ultimately led to factoring out the EdI language: all Eden language constructs are now implemented in Haskell, using the simpler primitive operations that implement EdI directly (Berthold & Loogen, 2007;Berthold, 2008).…”
Section: Implementations Of Gph and Edenmentioning
confidence: 99%
“…It splits the input list into two halves, keeps the first half for local evaluation and creates a child process on PE 2 for sorting the second half. The remaining ticket list [3..noPe] is unshuffled into the two lists [3,5,7] and [4,6,8]. The first sublist is kept locally while the child process gets the second one.…”
Section: Divide-and-conquermentioning
confidence: 99%
“…For the example tree in Figure 19 we observe that successors 3 2 = [7,8,9] and path 3 9 = [1,2]. If we neglect the case that the problem size might not be large enough to supply each process with work, the offline divide-and-conquer skeleton can be defined as follows:…”
Section: Tuning the Parallel Mergesort Programmentioning
confidence: 99%
See 2 more Smart Citations