Parallel $\mathcal O(\sqrt n)$ Overhead LSD Radix Sort

Robert Clausecker; Florian Schintke

Parallel $\mathcal O(\sqrt n)$ Overhead LSD Radix Sort

Data Structures and Algorithms 2026-07-06 v1 Databases

Authors: Robert Clausecker , Florian Schintke

Abstract

We present Radsort, a variant of LSD radix sort, sorting data with $\mathcal O(\sqrt n)$ additional space. Radsort is stable, admits a simple implementation and is easy to parallelise. For arrays exceeding a size of around 2 MiB it outperforms a conventional out-of-place LSD radix sort.

Cite

@article{arxiv.2607.05302,
  title  = {Parallel $\mathcal O(\sqrt n)$ Overhead LSD Radix Sort},
  author = {Robert Clausecker and Florian Schintke},
  journal= {arXiv preprint arXiv:2607.05302},
  year   = {2026}
}

Comments

16 pages, 6 figures