97 citations · 392 across the 64 of their papers we have counts for
3 papers · 2 filters
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…
Communication-free Massively Distributed Graph Generation
Daniel Funke, Sebastian Lamm, Ulrich Meyer +5
Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis…
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…