5 papers
Engineering In-place (Shared-memory) Sorting Algorithms
Michael Axtmann, Sascha Witt, Daniel Ferizovic +1
We present sorting algorithms that represent the fastest known techniques for a wide range of input sizes, input distributions, data types, and machines. A part of the speed advant…
Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort
Michael Axtmann, Armin Wiebigke, Peter Sanders
MPI uses the concept of communicators to connect groups of processes. It provides nonblocking collective operations on communicators to overlap communication and computation. Flexi…
In-place Parallel Super Scalar Samplesort (IPSo)
Michael Axtmann, Sascha Witt, Daniel Ferizovic +1
We present a sorting algorithm that works in-place, executes in parallel, is cache-efficient, avoids branch-mispredictions, and performs work O(n log n) for arbitrary inputs with h…
Robust Massively Parallel Sorting
Michael Axtmann, Peter Sanders
We investigate distributed memory parallel sorting algorithms that scale to the largest available machines and are robust with respect to input size and distribution of the input e…
Practical Massively Parallel Sorting
Michael Axtmann, Timo Bingmann, Peter Sanders +1
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We…