We analyze the running time of the Saukas-Song algorithm for selection on a coarse grained multicomputer without expressing the running time in terms of communication rounds. This shows that while in the best case the Saukas-Song algorithm runs in asymptotically optimal time, in general it does not. We propose other algorithms for coarse grained selection that have optimal expected running time.
Cite
@article{arxiv.1712.00870,
title = {Coarse Grained Parallel Selection},
author = {Laurence Boxer},
journal= {arXiv preprint arXiv:1712.00870},
year = {2020}
}