MPI collective operations such as MPI_Allreduce are fundamental basic blocks of large-scale applications in High Performance Computing. Since the MPI standard only defines the semantics of MPI communication operations, MPI implementations (e.g., Open MPI or MPICH) are free to implement the collective operations the best way possible. For important collective operations, e.g. MPI_Allreduce and MPI_Bcast, MPI libraries provide several algorithms for each operation.

In this talk, we investigate the problem of tuning MPI collective operations on a given supercomputer, i.e., selecting the best algorithm for a communication problem. For example, we would like to answer the following question: what is the fastest algorithm to execute an MPI_Bcast with 100 Bytes of data using 16 compute nodes and 32 processes per compute node. We also need to discuss the accuracy of methods that support the analysis of MPI applications, such as profiling or tracing. In addition, we show that basic methods from statistics and machine learning can help us to find efficient algorithms for collective operations in a practical setting.

Sascha Hunold is an associate professor at the TU Vienna, Austria. His research focuses on MPI, OpenMP, scheduling algorithms, and reproducibility in the context of parallel computing.

Sascha Hunold received his Ph.D. degree in Computer Science from the University of Bayreuth, Germany, and his M.Sc. degree in Computer Science from the University of Halle-Wittenberg, Germany.  Afterwards, he held postdoctoral positions in Berkeley, Grenoble, and Heidelberg.