Efficient Algorithms pp 143-157

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5760) | Cite as

A Pictorial Description of Cole’s Parallel Merge Sort

  • Torben Hagerup

Abstract

A largely pictorial description is given of a variant of an ingenious parallel sorting algorithm due to Richard Cole. The new description strives to achieve greater simplicity by exploiting symmetries that were not explicit in the original exposition and that can be conveyed nicely with pictures. Not paying attention to constant factors allows an additional slight simplification of the algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ajtai, M., Komlós, J., Szemerédi, E.: An O(nlogn) sorting network. In: 15th Annual ACM Symposium on Theory of Computing (STOC 1983), pp. 1–9 (1983)Google Scholar
  2. 2.
    Cole, R.: Parallel merge sort. SIAM J. Comput. 17, 770–785 (1988)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Torben Hagerup
    • 1
  1. 1.Institut für InformatikUniversität AugsburgAugsburgGermany

Personalised recommendations