Numerical methods and programming
 RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Num. Meth. Prog.: Year: Volume: Issue: Page: Find

 Num. Meth. Prog., 2016, Volume 17, Issue 3, Pages 318–328 (Mi vmp839)

Analysis and optimization of a $k$-chain reduction algorithm for distributed computer systems

M. G. Kurnosov

Siberian State University of Telecommunications and Informatics, Novosibirsk

Abstract: 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.

Keywords: MPI, root reduction, message passing models, MPI, parallel programming, distributed computer systems.

Full text: PDF file (329 kB)
UDC: 004.272

Citation: 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
\Bibitem{Kur16}
\by M.~G.~Kurnosov
\paper Analysis and optimization of a $k$-chain reduction algorithm for distributed computer systems
\jour Num. Meth. Prog.
\yr 2016
\vol 17
\issue 3
\pages 318--328
\mathnet{http://mi.mathnet.ru/vmp839}