2dt: a Parallel Programming Language Based on Two Dimensional Transformations for Eecient Programming of Multi Processors Networks

This work presents a novel paradigm for programming multi processors networks in both functional and algol like style. Let M be the union of all the processors memory, then a message passing can be veiwed as a transformation T : M ! M which transforms memory data from one processor to another. Using this veiw-point a new set of more gebneral transformations is derived, and is used for communication. Compare to massage passing based programs, 2DT enjoys the following advantages: It save the need to program communication protocols, by \forc-ing" the programmer to use built-in, high level and eecient communication transformations. The transformations (cite2dsimd) compresses many small messages into \big" packages, saving cpu-time needed for sending them one at a time. In particular, A 2DT expansion of FP ((3]) is devised. A simple semantic is used to show that the result of 2DT-FP is independent of the execution order. This should allows eecient implementations, and semantic simplicity. The paper includes examples of parallel matrix multiplication, parallel-preex and parallel quick sort.