An interprocedural framework for determining efficient data redistributions in distributed memory machines

This paper presents a framework to find good distributions for the global arrays at different program points in the presence of procedure calls. The distributions are chosen for their ability to offset the re-distribution overheads by contributing significantly towards increasing the performance gains. The algorithm uses interprocedural analysis and dynamic programming techniques. The working of the algorithm has been demonstrated for a CFD kernel.