Fast Parallel Space Allocation, Estimation, and Integer Sorting

Fast Parallel Space Allocation, Estimation and Integer Sorting

Fast Parallel Space Allocation, Estimation and Integer Sorting (revised) •

More Efficient Parallel Integer Sorting

We present a more efficient CREW PRAM algorithm for integer sorting. This algorithm sorts n integers in {0, 1, 2, ..., n} in O((log n)/ log log n) time and O(n(log n/ log log n)) operations. It also sorts n integers in {0, 1, 2, ..., n− 1} in O((log n)/ log log n) time and O(n(log n/ log log n) log log log n) operations. Previous best algorithm [13] on both cases has time complexity O(log n) bu...

On Parallel Hashing and Integer Sorting

On Parallel Hashing and Integer Sorting

The problem of sorting n integers from a restricted range [1..m], where m is superpolynomial in n, is considered. An o(nlog n) randomized algorithm is given. Our algorithm takes O(n log log m) expected time and 0(n) space. (Thus, for m nv ) we have an 0(n log log n) algorithm.) The algorithm is parallelizable. The resulting parallel algorithm achieves optimal speed up. Some features of the algo...

Parallel Integer Sorting with Medium and Fine-Scale Parallelism

Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort is designed for ne-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel...