COMPILING GLOBAL NAME-SPACE PARALLEL LOOPS FOR DISTRIBUTED EXECUTION

Distributed memory machines do not provide hardware support for a global address space. Thus, programmers are forced to partition the data across the memories of the architecture and use explicit message passing to communicate data between processors. In this paper, we focus on the compiler support required to allow programmers to express their algorithms using a global name-space. We present a general method for analysis of a high-level source program and its translation to a set of independently executing tasks communicating via messages. If the compiler has enough information, this translation can be carried out at compile-time. Otherwise, run-time code is generated to implement the required data movement. We describe the analyis required in both situations and present the performance of the generated code on the Intel iPSC/2.