The purpose of the project was the development of new algorithms for non-blocking and rarefied collective MPI operations.
Non-blocking and rarefied collective operations were added to the 3rd version of the MPI standard. Currently, MPI implementations with an open source code (MPICH*, Open MPI*) contain a small number of algorithms for these types of collective operations.
It was necessary to solve the following problems:
1. To research the existing set of algorithms for non-blocking and rarefied collective operations
2. To develop new algorithms and assess their performance
The algorithms have been developed for the following functions: MPI_allreduce, MPI_Bcast, MPI_reduce, MPI_Igather, MPI_scatter, MPI_Ineighbour_alltoall.
It is preferable to use the developed knomial algorithms for collective operations when the number of processes is multiple of knomial factor.
Test methods for the optimization of local exchanges for k-tree topology have been developed and investigated. Testing has shown that this modification of exchanges structure reduces the runtime of tests on the small-sized messages, but on the large-sized messages the algorithm begins to lose to the standard one.
Optimization methods for the Cartesian topology have been investigated. Optimization speeds up MPICH algorithm on the message of medium size 512-1024 bytes, the acceleration increases with the number of processes.
