Hypercubic Sorting Networks

@article{Leighton1998HypercubicSN,
  title={Hypercubic Sorting Networks},
  author={Frank Thomson Leighton and C. Greg Plaxton},
  journal={SIAM J. Comput.},
  year={1998},
  volume={27},
  pages={1-47}
}
This paper provides an analysis of a natural d-round tournament over n = 2 d players, and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is used to design eecient sorting algorithms for a variety of diierent models of parallel computation: (i) a comparator network of depth c lg n, c 7:44, that sorts the vast majority of the n! possible input permutations, (ii) an O(lg n)-depth hypercubic comparator network that sorts… CONTINUE READING