Compiling sequential programs for distributed memory parallel computers with PANDORE II

Parallelization of programs for distributed memory parallel computers is always difficult because of many low-level problems due to a programming model based on parallel processes. The Pandore system has been designed to allow programmers to maintain a sequential programming style. The Pandore compiler generates parallel processes according to a data decomposition specified by the programmer. For this purpose, new constructs have been added to an existing sequential language. Code generation relies on the SPMD model and on the locality of writes rule. A prototype has shown the feasibility of this approach. The second version of Pandore we are currently implementing is described here. We present the language features related to data distribution together with the compiling techniques. The programming methodology is illustrated by the parallelization of the Gram-Schmidt algorithm