Parallel sorting with minimal data

Authors:
Christian Siebert;Felix Wolf
Affiliations:
German Research School for Simulation Sciences, Aachen, and RWTH Aachen University, Computer Science Department, Aachen, Germany;German Research School for Simulation Sciences, Aachen, and RWTH Aachen University, Computer Science Department, Aachen, and Forschungszentrum Jülich, Jülich Supercomputing Centre, J ...
Venue:
EuroMPI'11 Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
Year:
2011

Citing 6
Cited 0

Parallel merge sort

SIAM Journal on Computing
Parallel sorting by regular sampling

Journal of Parallel and Distributed Computing
A high-performance, portable implementation of the MPI message passing interface standard

Parallel Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
A scalable MPI_Comm_split algorithm for exascale computing

EuroMPI'10 Proceedings of the 17th European MPI users' group meeting conference on Recent advances in the message passing interface

Quantified Score

Hi-index	0.00

Visualization

Abstract

For reasons of efficiency, parallel methods are normally used to work with as many elements as possible. Contrary to this preferred situation, some applications need the opposite. This paper presents three parallel sorting algorithms suited for the extreme case where every process contributes only a single element. Scalable solutions for this case are needed for the communicator constructor MPI Comm split. Compared to previous approaches requiring O(p) memory, we introduce two new parallel sorting algorithms working with a minimum of O(1) memory. One method is simple to implement and achieves a running time of O(p). Our scalable algorithm solves this sorting problem in O(log2 p) time.