Communication cost estimation and global data partitioning for distributed memory machines

Estimating communication cost involved in executing a program on distributed memory machines is important for evaluating the overheads due to repartitioning. The authors present a scheme which will work with reasonable efficiency for arrays with at most 3 dimensions. The hyperplane partitioning technique given by Prakash and Srikant (1997) is extended to complete programs by estimating the communication cost by the scheme presented in the work.