A wish list for efficient adjoints of one-sided MPI communication

  • Authors:
  • Michel Schanen;Uwe Naumann

  • Affiliations:
  • LuFG Informatik 12: Software and Tools for Computational Engineering, RWTH Aachen University, Germany;LuFG Informatik 12: Software and Tools for Computational Engineering, RWTH Aachen University, Germany

  • Venue:
  • EuroMPI'12 Proceedings of the 19th European conference on Recent Advances in the Message Passing Interface
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a generic approach to transforming one-sided MPI communication in the context of adjoint code. The adjoint allows us to compute gradients of multivariate function implementations at a computational cost that is independent of the size of these gradients. In this paper, we apply the adjoint model to codes containing one-side MPI communication. The Partitioned Global Address Space notation is used to derive the corresponding adjoint code. Our adjoint solutions rely on certain workarounds due to limited adjoint support in the current MPI standard. To avoid these, we provide a wish list for future MPI standards that potentially lead to a more efficient adjoint communication.