DREAM: The distributed Eden abstract machine

Breitinger, Silvia; Klusik, Ulrike; Loogen, Rita; Ortega-Mallén, Yolanda; Peña, Ricardo

doi:10.1007/bfb0055435

Cited by 13 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was originally implemented by adapting the GUM implementation to comply with the the DREAM abstract machine model (Breitinger et al, 1997). It has subsequently seen several complete rewrites and major revisions.…”

Section: Implementations Of Gph and Edenmentioning

confidence: 99%

See 1 more Smart Citation

PAEAN: Portable and scalable runtime support for parallel Haskell dialects

Berthold

Loidl²,

Hammond

2016

J. Funct. Prog.

View full text Add to dashboard Cite

Over time, several competing approaches to parallel Haskell programming have emerged. Different approaches support parallelism at various different scales, ranging from small multicores to massively parallel high-performance computing systems. They also provide varying degrees of control, ranging from completely implicit approaches to ones providing full programmer control. Most current designs assume a shared memory model at the programmer, implementation and hardware levels. This is, however, becoming increasingly divorced from the reality at the hardware level. It also imposes significant unwanted runtime overheads in the form of garbage collection synchronisation etc. What is needed is an easy way to abstract over the implementation and hardware levels, while presenting a simple parallelism model to the programmer.The PAEAN (PArallEl shAred Nothing) runtime system design aims to provide a portable and high-level shared-nothing implementation platform for parallel Haskell dialects. It abstracts over major issues such as work distribution and data serialisation, consolidating existing, successful designs into a single framework. It also provides an optional virtual shared-memory programming abstraction for (possibly) shared-nothing parallel machines, such as modern multicore/manycore architectures or cluster/cloud computing systems. It builds on, unifies, and extends, existing well-developed support for shared-memory parallelism that is provided by the widely-used GHC Haskell compiler. This paper summarises the state-of-the-art in shared-nothing parallel Haskell implementations, introduces the PAEAN abstractions, shows how they can be used to implement three distinct parallel Haskell dialects, and demonstrates that good scalability can be obtained on recent parallel machines. * Corresponding author. Reported work performed while at the University of Copenhagen (DIKU).

show abstract

Section: Implementations Of Gph and Edenmentioning

confidence: 99%

“…The DREAM RTS (Breitinger et al, 1998;Klusik et al, 1999) was the first working implementation of Eden. It was originally implemented by adapting the GUM implementation to comply with the the DREAM abstract machine model (Breitinger et al, 1997). It has subsequently seen several complete rewrites and major revisions.…”

Section: Implementations Of Gph and Edenmentioning

confidence: 99%

PAEAN: Portable and scalable runtime support for parallel Haskell dialects

Berthold

Loidl²,

Hammond

2016

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…8 Another key ancillary property of DCESH networks is that synchronous or asynchronous networks for single threaded computations behave essentially the same, 9 which means it is enough to deal with the simpler synchronous networks.…”

Section: Dcesh: the Distributed Cesh Machinementioning

confidence: 99%

“…The well-researched project Eden [29] and the associated abstract machine DREAM [8], which builds on Haskell, is a semiimplicit language. Eden allows expressing distributed algorithms at a high level of abstraction, and is mostly implicit about communication, but explicit about process creation.…”

Section: Related Workmentioning

confidence: 99%

Towards native higher-order remote procedure calls

Fredriksson

Ghica

Wheen

2014

Proceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages

View full text Add to dashboard Cite

We present a new abstract machine, called DCESH, which models the execution of higher-order programs running in distributed architectures. DCESH implements a native general remote higherorder function call across node boundaries. It is a modernised version of SECD enriched with specialised communication features required for implementing the remote procedure call mechanism. The key correctness result is that the termination behaviour of the remote procedure call is indistinguishable (bisimilar) to that of a local call. The correctness proofs and the requisite definitions for DCESH and other related abstract machines are formalised using Agda. We also formalise a generic transactional mechanism for transparently handling failure in DCESHs.We use the DCESH as a target architecture for compiling a conventional call-by-value functional language ("Floskel") which can be annotated with node information. Conventional benchmarks show that the single-node performance of Floskel is comparable to that of OCaml, a semantically similar language, and that distribution overheads are not excessive. Native RPC and transparent distributionThe remote procedure call (RPC) [7] is a widely used mechanism for higher-level inter-process communication. An RPC is what its name suggests: a call to a procedure located on a remote node. The idea is that an RPC looks and acts like an ordinary procedure call, and performs the necessary message passing under the hood. However, the RPC mechanism tends to be bolted on top of a pre-existing language, as a library for example, rather than be seamlessly integrated into it. This leads to significant syntactic differences between calling a local library function and a remote function. Even if these syntactic differences can be smoothed using stubs that wrap remote calls into local calls [6] important differences still persist, of which the most important is that arguments must be of ground types.Generalising RPC to all types and incorporating it seamlessly in the language has been considered but dismissed on grounds of potential inefficiencies [40]. However, considering that a number of technologies that trade efficiency for convenience have been rejected on similar grounds (from machine independent languages to functional programming, garbage collection or automated program verification -to name only a few), we decided it is time to revisit Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. IFL '14, October 1-3, 2014, Boston, MA, USA. Copyright c 20yy ACM 978-1-nnnn-nnnn-n/yy/...

show abstract

“…Indeed, several abstract machines have been suggested which implement parallel graph reduction, e.g. ν, G -machine [12], GRIP [106], GUM [122], and DREAM [22]. Also an abstract machine for parallel proof systems [67] is based on parallel graph reduction.…”

Section: Abstract Machines For Parallel Programming Languagesmentioning

confidence: 99%

Abstract machines for programming language implementation

Diehl¹,

Hartel²,

Sestoft³

2000

Future Generation Computer Systems

View full text Add to dashboard Cite

We present an extensive, annotated bibliography of the abstract machines designed for each of the main programming paradigms (imperative, object oriented, functional, logic and concurrent). We conclude that whilst a large number of efficient abstract machines have been designed for particular language implementations, relatively little work has been done to design abstract machines in a systematic fashion.

show abstract

DREAM: The distributed Eden abstract machine

Cited by 13 publications

References 15 publications

PAEAN: Portable and scalable runtime support for parallel Haskell dialects

PAEAN: Portable and scalable runtime support for parallel Haskell dialects

Towards native higher-order remote procedure calls

Abstract machines for programming language implementation

Contact Info

Product

Resources

About