Time-Space Optimal Parallel Merging and Sorting

  title={Time-Space Optimal Parallel Merging and Sorting},
  author={Xiaojun Guan and Michael A. Langston},
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


Publications citing this paper.
Showing 1-10 of 11 extracted citations

A time-space optimal parallel sorting on a hypercube

Wuhan University Journal of Natural Sciences • 2008
View 1 Excerpt

An Improved Parallel Sorting Algorithm for Odd Sequence

2008 International Conference on Advanced Computer Theory and Engineering • 2008
View 2 Excerpts

A unifiedO(logN) and optimal sorting vector algorithm

Journal of Computer Science and Technology • 1995
View 1 Excerpt

Empirical analysis of overheads in cluster environments

Concurrency - Practice and Experience • 1994
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 12 references

Parallel merge sort

M. A. Langston
SIAM J . Comput . • 1988

A taxonomy of parallel sorting

D. J. Dewitt, D. K. Hsiao, J. Menon
Comput . Surveys • 1984

Mapping with extemal I / O : A case study

S. Sahni
Proc . 1987 Int . Con 5 Parallel Processing • 1984

A survey of parallel algorithms for sharedmemory machines

V. Ramachandran

Similar Papers

Loading similar papers…