Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers

@inproceedings{Cypher1990DeterministicSI,
title={Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers},
author={Robert Cypher and C. Greg Plaxton},
booktitle={STOC},
year={1990}
}

This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n processor hypercube, shuffle-exchange or cube-connected cycles in O(log n(loglog n) 2) time in the worst case. The algorithm requires only a constant amount of storage at each processor. The fastest previous deterministic algorithm for this problem was bitonic sort [3], which runs in O(log 2 n) time. 1 I n t r o d u c t i o n Given n records distributed uniformly over the n processors of some… CONTINUE READING