Automatic Code Motion to Extend MPI Nonblocking Overlap Window

Van-Man Nguyen (1, 2, 3) , Emmanuelle Saillard (2) , Julien Jaeger (1, 3) , Denis Barthou (2, 4) , Patrick Carribault (1, 3)

1 CEA - Commissariat à l'énergie atomique et aux énergies alternatives
2 STORM - STatic Optimizations, Runtime Methods
3 LIHPC - Laboratoire en Informatique Haute Performance pour le Calcul et la simulation
4 LaBRI - Laboratoire Bordelais de Recherche en Informatique

HPC applications rely on a distributed-memory parallel programming model to improve the overall execution time. This leads to spawning multiple processes that need to communicate with each other to make the code progress. But these communications involve overheads caused by network latencies or synchronizations between processes. One possible approach to reduce those overheads is to overlap communications with computations. MPI allows this solution through its nonblocking communication mode: a nonblocking communication is composed of an initialization and a completion call. It is then possible to overlap the communication by inserting computations between these two calls. The use of nonblocking collective calls is however still marginal and adds a new layer of complexity. In this paper we propose an automatic static optimization that (i) transforms blocking MPI communications into their nonblocking counterparts and (ii) performs extensive code motion to increase the size of overlapping intervals between initialization and completion calls. Our method is implemented in LLVM as a compilation pass, and shows promising results on two mini applications.

Mots clés: Static optimization; Message Passing Interface; Nonblocking communications

Domaines: Informatique [cs]; Calcul parallèle, distribué et partagé [cs.DC]

Van-Man Nguyen, Emmanuelle Saillard, Julien Jaeger, Denis Barthou, Patrick Carribault. Automatic Code Motion to Extend MPI Nonblocking Overlap Window. C3PO'20 Workshop - First Workshop on Compiler-Assisted Correctness Checking and Performance Optimization for HPC, Jun 2020, Frankfurt / Virtual, Germany. pp.43-54, ⟨10.1007/978-3-030-59851-8_4⟩. ⟨cea-03010533⟩