A parallel bucket sort

https://doi.org/10.1016/0020-0190(88)90092-0Get rights and content

Abstract

The problem to sort integers on a parallel RAM (PRAM) is investigated. An algorithm sorting n integers on n/log n processors in expected time O(log n) is presented. It is a parallel version of the bucket sort. The simultaneous resource bounds of this algorithm are asymptotically optimal.

References (16)

There are more references available in the full text version of this article.

Cited by (12)

  • ERCW PRAMs and optical communication

    1998, Theoretical Computer Science
  • Odd-even, compare-exchange parallel sorting

    1994, Microprocessing and Microprogramming
  • Hybridsort revisited and parallelized

    1989, Information Processing Letters
  • Parallel iterated bucket sort

    1989, Information Processing Letters
  • Big data processing with 1D-Crosspoint Arrays

    2023, International Journal of Parallel, Emergent and Distributed Systems
View all citing articles on Scopus

This work was partly prepared while the author was visiting the Institute of Technical Cybernetics at the Slovac Academy of Sciences at Bratislava.

View full text