The Distributed Selection Problem and the AKS Sorting Network

Abstract

We consider the selection problem on a completely connected network of n processors with no shared memory. Each processor initially holds a given numeric item of b bits, allowed to send a b-bit message to another processor at a time. On such a communication network G, we show that the k smallest of the n inputs can be detected in O (logn) time with O (n log… (More)

Topics

1 Figure or Table

Cite this paper

@article{Berman2015TheDS, title={The Distributed Selection Problem and the AKS Sorting Network}, author={Piotr Berman and Junichiro Fukuyama}, journal={CoRR}, year={2015}, volume={abs/1511.00715} }