Silvia Breitinger

The Eden coordination model for distributed memory systems

Eden is a concurrent declarative language that aims at both the programming of reactive systems and parallel algorithms on distributed memory systems. In this paper, we explain the computation and coordination model of Eden. We show how lazy evaluation in the computation language is fruitfully combined with the coordination language that is specifically designed for multicomputers and that aims at maximum parallelism.

From (Sequential) Haskell to (Parallel) Eden: An Implementation Point of View

The explicitly parallel programming language Eden adds a coordination level to the lazy functional language Haskell. This paper describes how a compiler and runtime system for Eden can incrementally be built on the basis of a compiler and runtime system for the computation language. The modifications needed in the compiler are restricted to specific orthogonal extensions. We show that Edens design for distributed memory systems proves beneficial for the construction of a lean parallel runtime system.

Eden - The Paradise of Functional Concurrent Programming

The functional concurrent language Eden is an extension of the lazy functional language Haskell by constructs for the explicit speciication of dynamic process systems. It employs stream-based communication and is tailored for distributed memory systems. Eden supports and facilitates the task of parallel and concurrent programming. To illustrate this statement the paper includes elegant solutions to traditional concurrency problems.

Improving Search for Job-Shop Scheduling with CLP(FD)

Constraint logic programming can be effectively applied to solve realistic job-shop scheduling problems. The role of constraints is twofold: they model dependencies among tasks and resources (e.g. temporal relations and capacities of machines), and they are used to actively prune the search space during the computation of a schedule. Since the job-shop problem is NP-complete, constraint solving techniques alone do not suffice to get efficient schedules for problems with 100 tasks and more. In order to judge a scheduling method, one has to investigate two questions: how good are the solutions in comparison to the optimum and how much search is required to find them.

An Implementation of Eden on Top of Concurrent Haskell

The functional concurrent language Eden is an extension of the lazy functional language Haskell by high level constructs for the explicit specification of dynamically evolving process systems. It employs stream-based implicit communication.

DREAM: The DistRibuted Eden Abstract Machine

Eden is being implemented by extending the Glasgow Haskell Compiler (GHC) which is based on the Spineless Tagless G-Machine (STGM). In this paper we present a parallel abstract machine which embodies the STGM for sequential computations and describes a distributed runtime environment for Eden programs on an abstract level.