A generalized framework for global communication optimization

In distributed memory message passing architectures reducing communication cost is extremely important. We present a technique to optimize communication globally. Our approach is based on a combination of linear algebra and dataflow analysis, and can take arbitrary control flow into account. The distinctive features of the algorithm are its accuracy in keeping communication set information and its support for general alignments and distributions including block-cyclic distributions. The method is being implemented in the PARADIGM compiler. The preliminary results show that the technique is effective in reducing both the number as well as the volume of communication