New Parallel-Sorting Schemes

@article{Preparata1978NewPS,
  title={New Parallel-Sorting Schemes},
  author={Franco P. Preparata},
  journal={IEEE Transactions on Computers},
  year={1978},
  volume={C-27},
  pages={669-673}
}
In this paper, we describe a family of parallel-sorting algorithms for a multiprocessor system. These algorithms are enumeration sortings and comprise the following phases: 1) count acquisition: the keys are subdivided into subsets and for each key we determine the number of smaller keys (count) in every subset; 2) rank determination: the rank of a key is the sum of the previously obtained counts; 3) data rearrangement: each key is placed in the position specified by its rank. The basic novelty… CONTINUE READING