Transformation of Functional Programs into Data Flow Graphs implemented with PVM

. We present an implementation of the functional language FASAN for automatic coarse-grain program parallelization on workstation clusters. It is designed primarily for recursive numerical algorithms with distributed tree-like data structures and it exploits the maximal inherent parallelism of a program. Based on the stream and data flow semantics of the language, the compiler generates C procedures for building the data flow graph as dynamic data structure. FASAN schedulers evaluate the function nodes in parallel, and provide for all necessary communication using the PVM library. The new concept of "wrapper streams" for tree data structures avoids superfluous synchronization. 1 Introduction Modern numerical algorithms concerning partial differential equations are often based on the technique of recursive domain decomposition or sub-structuring [2]. Instead of arrays, trees are the natural and suitable data structures for implementations of those recursive algorithms. However, their p..