Research Directions in Parallel Functional Programming
Research Directions in Parallel Functional Programming
Introduction to Functional Programming
Introduction to Functional Programming
B(PN)2 - a Basic Petri Net Programming Notation
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
GpH and Eden: Comparing two parallel functional languages on a Beowulf cluster
Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00)
Patterns and skeletons for parallel and distributed computing
Patterns and skeletons for parallel and distributed computing
Comparing Parallel Functional Languages: Programming and Performance
Higher-Order and Symbolic Computation
Advances in dataflow programming languages
ACM Computing Surveys (CSUR)
Coordination language for distributed clean
Acta Cybernetica
NiMoToons: a Totally Graphic Workbench for Program Tuning and Experimentation
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic testing of higher order functions
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Parallel elementwise processable functions in concurrent clean
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
D-Clean primitives are first class citizens which allows the coordination of a dynamical work distributions over a cluster. The computations are distributed automatically over the Grid by the middleware system. The programmer controls the computation nodes in the generated boxes and the communication on the generated channels. In order to obtain highly abstract description about how the coordination primitives work, a generic model of the executable semantics is needed. This paper provides a more general version of the simulation of the real parallel computation in the D-Clean extension of the Clean language. First, the executable semantics definition for each D-Clean primitive is given in an abstract way. Second, we describe a graphical system that generates the computation scheme visualizing the maximum amount of parallelism. Finally, we state properties of the executable description of the distributed system designed for D-Clean and D-Box.