INTRODUCTION 2 1 Introduction It seems to be generally accepted that the most convenient machines to write parallel programs for, are synchronous MIMD (Multiple Instruction Multiple Data) computers with shared memory, well--known to theoreticians as PRAMs (i.e., Parallel Random Access Machines). A realization of such a machine in hardware, the SB-PRAM, is undertaken by a project of W.J. Paul at
... [Show full abstract] Saarbrucken [AKP91]. The shared memory with random access allows for a fast and easy exchange of data between the processors, while the common clock guarantees deterministic program execution. Accordingly, a huge amount of algorithms has been invented for this type of architecture. Surprisingly enough, not much attempts have been made to develop languages which allow both to conveniently express algorithms and generate