Implementing Distributed Skeletons using D-Clean and D-Box?

Abstract. The distributed evaluation of functional programs and the communication between computational nodes require high-level process description and coordination mechanism. D-Clean is a high-level func-tional language, which supports the distributed computation of Clean functions over a cluster. The lazy functional programming language Clean is extended by new language elements in order to achieve parallel fea-tures. A process scheme defines a partial computation graph, where the nodes are functions to be evaluated and the edges are communication chan-nels. The computational nodes are implemented as statically typed Clean programs. D-Clean is compiled to an intermediate level language called D-Box. The D-Clean generic constructs are instantiated into D-Box ex-pressions. D-Box is designed for the description of the computational nodes. The highest level the D-Clean coordination language primitives are ap-plied for distributing the pure functional computation subtasks over a PC cluster. The distribution is made according to computation patterns, skeletons parameterized by the functions, types and data. This paper presents some of the classical skeletons written in the D-Clean and D-Box langauges showing the appropriateness and applicability of the languages for designing distributed computation patterns.