Abstract: We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and $O(\log n)$ 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(\log n)$ time. The constant in the running time is still moderate, though not as small.
Publication Year: 1988
Publication Date: 1988-08-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 729
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot