Compiling Haskell by Program Transformation: A Report from the Trenches
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
SFP '99 Selected papers from the 1st Scottish Functional Programming Workshop (SFP99)
Deriving Non-Hierarchical Process Topologies
SFP '01 Selected papers from the 3rd Scottish Functional Programming Workshop (SFP01)
DREAM: The DistRibuted Eden Abstract Machine
IFL '97 Selected Papers from the 9th International Workshop on Implementation of Functional Languages
Coordination language for distributed clean
Acta Cybernetica
Analyzing the influence of mixed evaluation on the performance of Eden skeletons
Parallel Computing - Algorithmic skeletons
Dealing Denotationally With Stream-based Communication
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Eden is a parallel functional language which extends Haskell with new expressions to define and instantiate processes. These extensions allow the easy definition of parallel process topologies as higher order functions. Unfortunately, by only using process abstractions and instantiations it is not possible to implement non-hierarchical topologies, as processes can only communicate with its parent or its children. In this paper we show how to implement nonhierarchical topologies in Eden by using its dynamic channels. The topologies will be specified by only using process abstractions and instantiations, so that they will really be hierarchical. Afterwards, they will be refined into truly nonhierarchical topologies using the dynamic reply channels. The usefulness of the translation method will be shown by examples, highlighting the key points to be taken into account to achieve the desired behaviour.