@inproceedings{Guan1989TimeSpaceOP,
title={Time-Space Optimal Parallel Merging and Sorting},
author={Xiaojun Guan and Michael A. Langston},
booktitle={ICPP},
year={1989}
}

A parallel algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space per processor even when the number of processors is fixed. Previously published parallel merging and sorting algorithms fail to meet at least one of these criteria. In this paper, we present a parallel merging algorithm that, on an EREW PRAM with k processors, merges two sorted lists of total length n in O ( n / k + log n) time and O(k) extra space, and is thus time… CONTINUE READING