Accurate runtime selection of optimal MPI collective algorithms using analytical performance modelling
Accurate runtime selection of optimal MPI collective algorithms using analytical performance modelling
复制标题
使用分析性能建模准确选择最佳 MPI 集体算法的运行时
DOI:
--
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Alexey L. Lastovetsky
中科院分区:
文献类型:
--
作者:
Emin Nuriyev;Alexey L. Lastovetsky
The performance of collective operations has been a critical issue since the advent of MPI. Many algorithms have been proposed for each MPI collective operation but none of them proved optimal in all situations. Different algorithms demonstrate superior performance depending on the platform, the message size, the number of processes, etc. MPI implementations perform the selection of the collective algorithm empirically, executing a simple runtime decision function. While efficient, this approach does not guarantee the optimal selection. As a more accurate but equally efficient alternative, the use of analytical performance models of collective algorithms for the selection process was proposed and studied. Unfortunately, the previous attempts in this direction have not been successful. We revisit the analytical model-based approach and propose two innovations that significantly improve the selective accuracy of analytical models: (1) We derive analytical models from the code implementing the algorithms rather than from their high-level mathematical definitions. This results in more detailed models. (2) We estimate model parameters separately for each collective algorithm and include the execution of this algorithm in the corresponding communication experiment. We experimentally demonstrate the accuracy and efficiency of our approach using Open MPI broadcast and gather algorithms and a Grid5000 cluster.