Detail of the whole MPI algorithm?

Is there any document on how MPI functions are implemented, such as MPI_Algather, MPI_AlltoAll, MPI_Allreduce, etc.?

I would like to learn about their algorithm and calculate their complexity with respect to unidirectional or bidirectional bandwidth and the total data transfer size for multiple nodes and a fixed data size.

+4
source share
2 answers

I think that the exact execution of these algorithms varies depending on the communication mechanism: for example, the network will have tree-based reduction algorithms, while the models with shared memory will have different ones.

I'm not quite sure where to find answers to such questions, but I think that a good search for documents in google scientar or by looking at this sheet in open-mpi.org should be useful.

+1
source

http://www.amazon.com/Parallel-Programming-MPI-Peter-Pacheco/dp/1558603395/ref=sr_1_10?s=books& that is = UTF-8 & QID = 1314807638 & cf = 1-10

shown above is a great link that explains all the basic MPI algorithms and allows you to implement a simple version yourself. However, when comparing between the implemented algorithms and the MPI algorithms, you will see that they made many optimizations depending on the size of the message and the number of nodes on which you work. Hope this helps

0
source

All Articles