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 language | English (US) |
---|---|
Pages (from-to) | 57-61 |
Number of pages | 5 |
Journal | Information Processing Letters |
Volume | 27 |
Issue number | 2 |
DOIs | |
State | Published - Feb 29 1988 |
Externally published | Yes |
Keywords
- Analysis of algorithms
- integer sorting
- optimal parallel algorithm
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications