Howard B. Demuth

Learn More
In this paper we describe four parallel merge-sort algorithms: (I) Parallel merging; (2) Bubble/merge; (3) Batcher's odd-even merge; and (4) Quicksort/merge. In each algorithm we divide a sequence of numbers of length n into k sub-sequences of equal length. Using k processors we sort each subsequence using a serial algorithm, either Merge-sort, Bubble,(More)
  • 1