## Communication-Efficient Parallel Sorting (1996)

Citations: | 64 - 2 self |

### BibTeX

@INPROCEEDINGS{Goodrich96communication-efficientparallel,

author = {Michael Goodrich},

title = {Communication-Efficient Parallel Sorting},

booktitle = {},

year = {1996},

pages = {247--256}

}

### Years of Citing Articles

### OpenURL

### Abstract

We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most h items in any round. We provide parallel sorting methods that use internal computation time that is O( n log n p ) and a number of communication rounds that is O( log n log(h+1) ) for h = \Theta(n=p). The internal computation bound is optimal for any comparison-based sorting algorithm. Moreover, the number of communication rounds is bounded by a constant for the (practical) situations when p n 1\Gamma1=c for a constant c 1. In fact, we show that our bound on the number of communication rounds is asymptotically optimal for the full range of values for p, for we show that just computing the "or" of n bits distributed evenly to the first O(n=h) of an arbitrary number of processors in a BSP computer requires\Omega\Gammaqui n= log(h...