A parallel bucket sort

Research output: Contribution to journalArticle

8 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)57-61
Number of pages5
JournalInformation Processing Letters
Volume27
Issue number2
DOIs
Publication statusPublished - Feb 29 1988
Externally publishedYes

    Fingerprint

Keywords

  • Analysis of algorithms
  • integer sorting
  • optimal parallel algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this