A Benchmark Parallel Sort for Shared Memory Multiprocessors

@article{Francis1988ABP,
  title={A Benchmark Parallel Sort for Shared Memory Multiprocessors},
  author={Rhys S. Francis and Ian D. Mathieson},
  journal={IEEE Trans. Computers},
  year={1988},
  volume={37},
  pages={1619-1626}
}
This paper exhibits the first parallel sort algorithm for shared memory MIMD multiprocessors which has a theoretical and measured speedup near linear. The algorithm is based on a new asynchronous parallel merge which evenly partitions data to be merged between any number of processors. The merge of data sets @ and 63 on p processors has a time complexity of O((l@.l + l @ l ) / p ) + O(1og (min (I@(, 163 I))) in its asynchronous form and a space complexity of 2(l@l + 1631). A benchmark sorting… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS
23 Extracted Citations
0 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Similar Papers

Loading similar papers…