Automatic global data partitioning for distributed memory machines (DMMs) is a difficult problem. In this work, we present a partitioning strategy called 'hyperplane partitioning' which also works well with loops with non-uniform dependences. Several optimizations and an implementation on IBM-SP2 are described.
['S.R. Syam Prakash', 'Y. N. Srikant']
Hyperplane partitioning: an approach to global data partitioning for distributed memory machines