Hyperplane Partitioning : An Approach to Global Data Partitioning for Distributed Memory Machines

摘要

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.