A faster sorting algorithm in the broadcast communication model
Stephan Olariu, Jim L. Schwing · 2002
We present a simple sorting algorithm for the broadcast communication model (BCM, for short). With a sequence on n items as input, our algorithm runs in O(/sup n///sub p/log/sup n///sub p/+logk) time on a p-processor, k-channel BCM, a considerable improvement over the state of the art.>