Parallel Merge Sort

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Oct 1986 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 17, pages 770-785 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Richard Cole 0001;

doi: 10.1137/0217049 , 10.1109/sfcs.1986.41

Parallel Merge Sort

- Summary
- Subjects
- Metrics

Abstract

Summary: 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.

Related Organizations

New York University
United States

Keywords

parallel algorithm, Analysis of algorithms and problem complexity, merge sort, EREW PRAM, Models of computation (Turing machines, etc.), Searching and sorting, CREW PRAM

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	591
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 0.1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 1%