Parallel Merge Sort

Download PDF
Open Webpage

Richard Cole

Published: 1986, Last Modified: 12 May 2025FOCS 1986EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the constant in the running time is small. We also give a more complex version of the algorithm for the EREW PRAM; it also uses n processors and O(logn) time. The constant in the running time is still moderate, though not as small.