Regular article
Parallel sorting by regular sampling

https://doi.org/10.1016/0743-7315(92)90075-XGet rights and content

Abstract

A new parallel sorting algorithm suitable for MIMD multiprocessor is presented. The algorithm reduces memory and bus contention, which many parallel sorting algorithms suffer from, by using a regular sampling of the data to ensure good pivot selection. For n data elements to be sorted and p processors, when np3 the algorithm is shown to be asymptotically optimal. In theory, the algorithm is within a factor of 2 of achieving ideal load balancing. In practice, there is almost a perfect partitioning of work. On a variety of shared and distributed memory machines, the algorithm achieves better than half-linear speedups.

References (26)

  • M. Beltrametti et al.

    PAMS/SPS-2 system overview

  • J. Deminet

    Experience with multiprocessor algorithms

    IEEE Trans. Comput.

    (1982)
  • D.J. Evans et al.

    Analysis of the performance of the parallel quicksort method

    BIT

    (1985)
  • Cited by (154)

    View all citing articles on Scopus

    Funding for this research was provided by the Canadian Natural Sciences and Engineering Research Council, Grant OGP-8173.

    View full text