A parallel bucket sort

Bogdan S. Chlebus(corresponding author)

*Corresponding author for this work

University of Warsaw

Scholary Output:

Contribution to journal

Article

Peer-review

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.

Publication Information

Output type

Scholary Output:

Contribution to journal

Article

Peer-review

Original language

English (US)

Pages from-to (Number of pages)

Pages 57-61 (5 pages)

Journal (Volume, Issue Number)

Information Processing Letters (Volume 27, Issue 2)

Publication milestones

Published - 02/29/1988

Publication status

Published - 02/29/1988

ISSN

0020-0190

Publication IDs

Scopus: 0023962639

Access to documents

10.1016/0020-0190(88)90092-0

Publication metrics

Metrics

Fractional count

Scopus

citations

PlumX, opens in new tab

Captures

Citation count