Parallel distributive partitioned sorting methods

1 January 1984

journal article
research article
Published by Taylor & Francis in International Journal of Computer Mathematics

Vol. 15 (1-4) , 231-254
https://doi.org/10.1080/00207168408803412

Abstract

In this paper, the distributive partitioned sorting method is developed into parallel forms suitable for use on a parallel computer. The algorithms are analysed and implemented on the Loughborough University NEPTUNE parallel system and shown to be competitive with a parallel Quicksort algorithm.

Keywords

This publication has 7 references indexed in Scilit:

Usort: An efficient hybrid of Distributive Partitioning Sorting
BIT Numerical Mathematics, 1982
The design and analysis of a new hybrid sorting algorithm
Information Processing Letters, 1980
A fast sorting algorithm, a hybrid of distributive and merge sorting
Information Processing Letters, 1980
Sorting by distributive partitioning
Information Processing Letters, 1978
The analysis of Quicksort programs
Acta Informatica, 1977
Expected time bounds for selection
Communications of the ACM, 1975
Sorting
ACM Computing Surveys, 1971