Parallel Merge Sort

Richard Cole

doi:10.1137/0217049

ScienceGate Book Chapters

JOURNAL ARTICLE

Parallel Merge Sort

Richard Cole

Year: 1988 Journal: SIAM Journal on Computing Vol: 17 (4)Pages: 770-785 Publisher: Society for Industrial and Applied Mathematics

DOI: 10.1137/0217049

Get Full-Text PDF Get Analytical Report

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.

Keywords:

Merge (version control) sort Merge algorithm Computer science Parallel computing Binary logarithm Running time Merge sort Log-log plot Constant (computer programming) Parallel algorithm Combinatorics Algorithm Mathematics Sorting algorithm Programming language Database

Metrics

732

Cited By

25.44

FWCI (Field Weighted Citation Impact)

Refs

1.00

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Algorithms and Data Compression

Physical Sciences → Computer Science → Artificial Intelligence

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Parallel Merge Sort

Abstract

Metrics

Citation History

Topics

Related Documents

Parallel merge sort

Correction: Parallel Merge Sort

Parallel patterns: merge sort

Data-Adapted Parallel Merge Sort

Parallel Merge Sort with Load Balancing