Parallel merge sort

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)770-785
Number of pages16
JournalSIAM Journal on Computing
Volume17
Issue number4
StatePublished - Aug 1988

Fingerprint

Sort
EREW PRAM
Parallel Implementation

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Theoretical Computer Science

Cite this

Parallel merge sort. / Cole, Richard.

In: SIAM Journal on Computing, Vol. 17, No. 4, 08.1988, p. 770-785.

Research output: Contribution to journalArticle

Cole, R 1988, 'Parallel merge sort', SIAM Journal on Computing, vol. 17, no. 4, pp. 770-785.
Cole, Richard. / Parallel merge sort. In: SIAM Journal on Computing. 1988 ; Vol. 17, No. 4. pp. 770-785.
@article{c615f5eac6164fc6bb17d6118ff6c326,
title = "Parallel merge sort",
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.",
author = "Richard Cole",
year = "1988",
month = "8",
language = "English (US)",
volume = "17",
pages = "770--785",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "4",

}

TY - JOUR

T1 - Parallel merge sort

AU - Cole, Richard

PY - 1988/8

Y1 - 1988/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024057356&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024057356&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0024057356

VL - 17

SP - 770

EP - 785

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 4

ER -