A new algorithm, Guidesort, for sorting in the uniprocessor variant of the parallel disk model (PDM) of Vitter and Shriver is presented. The algorithm is deterministic and executes a number of (parallel) I/O operations that comes within a constant factor C of the optimum. The algorithm and its analysis are simpler than those proposed in previous work, and the achievable constant factor C of essentially 3 appears to be smaller than for all other known deterministic algorithms, at least for plausible parameter values.
@article{arxiv.1807.11328,
title = {Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model},
author = {Torben Hagerup},
journal= {arXiv preprint arXiv:1807.11328},
year = {2019}
}