A Generalized Framework for Global Communication Optimization

  • Authors:
  • Affiliations:
  • Venue:
  • IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

In distributed-memory message-passing architectures reducing communication cust is extremely important. In this paper, we present a technique tu optimize communication globally. Our approach is bused on a combination of linear algebra framework and dataflow analysis, and can take arbitray control flow into account. The distinctive features of the algorithm are its accuracy in keeping comnmnication set information and its support for general alignments and distributions including block-cyclic distributions. The method is currenrlv being implemented in the PARADIGM compiler. The preliminan, results show that the technique is efective in reducing both number us well as volume of the communication.