[Back]

C. Siebert, J. Träff:
"Efficient MPI Implementation of a Parallel, Stable Merge Algorithm";
Talk: 19th European MPI Users' Group Meeting, EuroMPI 2012, Vienna, Austria; 2012-09-23 - 2012-09-26; in: "Recent Advances in the Message Passing Interface Proceedings of the 19th European MPI Users' Group Meeting, EuroMPI 2012", J. Träff, S. Benkner, J. Dongarra (ed.); Springer, LNCS 7490 (2012), ISBN: 978-3-642-33517-4; 204 - 213.

We study different approaches to implement an optimal, stable two-way merge algorithm for distributed-memory parallel architectures. The algorithm takes as input two ordered sequences, which are distributed blockwise across all available processes such that each process owns a block of elements of each sequence. The task for each process is to produce an ordered block of elements from the stable merge of the input sequences. We present an optimal, perfectly load-balanced, stable parallel algorithm that accomplishes this task. We describe three different implementation alternatives using one-sided communication of the Message-Passing Interface (MPI). Further, we discuss problematic issues with the current MPI 2.2 one-sided interface and enabling features that may be found in future versions of the MPI standard. Experimental results on a large IBM Blue Gene/P supercomputer show perfect scalability of our implementation: with a fixed input size per process the running time remains (almost) constant with increasing number of processes, and with a fixed total problem size our implementation improves the time to solution for up to 32,768 MPI processes.