Compile-time techniques for data distribution in distributed memory machines
Jagannathan Ramanujam, Ponnuswamy Sadayappan · IEEE Transactions on Parallel and Distributed Systems · 1991
A solution to the problem of partitioning data for distributed memory machines is discussed. The solution uses a matrix notation to describe array accesses in fully parallel loops, which allows the derivation of sufficient conditions for communication-free partitioning (decomposition) of arrays. A series of examples that illustrate the effectiveness of the technique for linear references, the use of loop transformations in deriving the necessary data decompositions, and a formulation that aids in deriving heuristics for minimizing a communication when communication-free partitions are not feasible are presented.>