Using simulation to examine the effect of MPI message matching costs on application performance

S Levy and KB Ferreira and W Schonbein and RE Grant and MGF Dosanjh, PARALLEL COMPUTING, 84, 63-74 (2019).

DOI: 10.1016/j.parco.2019.02.008

Attaining high performance with MPI applications requires efficient message matching to minimize message processing overheads and the latency these overheads introduce into application communication. In this paper, we use a validated simulation-based approach to examine the relationship between MPI message matching performance and application time-to-solution. Specifically, we examine how the performance of several important HPC workloads is affected by the time required for matching. Our analysis yields several important contributions: (i) the performance of current workloads is unlikely to be significantly affected by MPI matching unless match queue operations get much slower or match queues get much longer; (ii) match queue designs that provide sublinear performance as a function of queue length are unlikely to yield much benefit unless match queue lengths increase dramatically; and (iii) we provide guidance on how long the mean time per match attempt may be without significantly affecting application performance. The results and analysis in this paper provide valuable guidance on the design and development of MPI message match queues. (C) 2019 Published by Elsevier B.V.

Return to Publications page