Two techniques for static array partitioning on message-passing parallel machines

Abstract

We present two techniques for partitioning arrays in parallel DoAll loops for message-passing parallel machines. (1) Communication-free array partitioning: a general solution of communication-free partitioning is derived for arrays in a DoAll loop. The derivation is based on the Smith normal form decomposition of the matrix which characterizes the array references in a DoAll loop. (2) One block-communication partitioning: when communication-free partitioning is not possible, we derive the partitioning equations which allocate all remote data to a unique processor. Thus, at most one block-communication is required for each processor to obtain the remote data it needs during computation.