Analysis and optimization of a $k$-chain reduction algorithm for distributed computer systems
M. G. Kurnosov
Siberian State University of Telecommunications and Informatics, Novosibirsk
In the LogP model of parallel computing, an analytical expression of the $k$-chain algorithm's execution time is derived. The optimal value of $k$ in the LogP model is found. A new algorithm based on the optimal value of $k$ is developed. For the reduction of root process's waiting time, an algorithm with an adaptive number of chains is proposed. The dependence of the execution time of the proposed algorithm on the number of processes has a growth rate of O(sqrt(P)), which is more efficient compared to the linear running time of the original $k$-chain algorithm. The proposed algorithms are implemented in the MPI standard and studied on computer clusters with InfiniBand QDR networks.
MPI, root reduction, message passing models, MPI, parallel programming, distributed computer systems.
PDF file (329 kB)
M. G. Kurnosov, “Analysis and optimization of a $k$-chain reduction algorithm for distributed computer systems”, Num. Meth. Prog., 17:3 (2016), 318–328
Citation in format AMSBIB
\paper Analysis and optimization of a $k$-chain reduction algorithm for distributed computer systems
\jour Num. Meth. Prog.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|