Towards Optimal Parallel Bucket Sorting

  title={Towards Optimal Parallel Bucket Sorting},
  author={Torben Hagerup},
  journal={Inf. Comput.},
It is well known (Ajtai et al., 1983; Cole, 1986; Leighton, 1984) that n objects drawn from an arbitrary totally ordered universe can be sorted by n processors in @log n) time, even given a very weak model of parallel computation such as the processor network of bounded degree (assuming, of course, that binary comparisons take unit time). This result is… CONTINUE READING