A parallel bucket sort

Bogdan S. Chlebus

Research output: Contribution to journalArticle

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
StatePublished - Feb 29 1988
Externally publishedYes

Fingerprint

Sort
Integer
Sorting algorithm
Random access storage
Asymptotically Optimal
Sorting
Resources

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

A parallel bucket sort. / Chlebus, Bogdan S.

In: Information Processing Letters, Vol. 27, No. 2, 29.02.1988, p. 57-61.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. / A parallel bucket sort. In: Information Processing Letters. 1988 ; Vol. 27, No. 2. pp. 57-61.
@article{1ea4c91ab45e4c82a72f503372cad4c7,
title = "A parallel bucket sort",
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.",
keywords = "Analysis of algorithms, integer sorting, optimal parallel algorithm",
author = "Chlebus, {Bogdan S.}",
year = "1988",
month = "2",
day = "29",
doi = "10.1016/0020-0190(88)90092-0",
language = "English (US)",
volume = "27",
pages = "57--61",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - A parallel bucket sort

AU - Chlebus, Bogdan S.

PY - 1988/2/29

Y1 - 1988/2/29

N2 - 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.

AB - 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.

KW - Analysis of algorithms

KW - integer sorting

KW - optimal parallel algorithm

UR - http://www.scopus.com/inward/record.url?scp=0023962639&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023962639&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(88)90092-0

DO - 10.1016/0020-0190(88)90092-0

M3 - Article

AN - SCOPUS:0023962639

VL - 27

SP - 57

EP - 61

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 2

ER -