Key points are not available for this paper at this time.
Abstract. We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the con-stant 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. 1.
Richard Cole (Mon,) studied this question.