The sorting algorithm derives its speed from a fast solution to a special list ranking problem of possible independent interest, the monotonic list ranking ...

Such operations include sign test, addition, subtraction, multi- plication, and arbitrary bit shifts, i.e., multiplication and integer division by powers of 2 ...

Recommendations · Parallel database sorting. Sorting in database processing is frequently required through the use of Order By and Distinct clauses in SQL.

We show thatnintegers in the range 1, …, ncan be sorted stably on an EREW PRAM usingO(t) time andO(n( log n log log n +(log n)2/t)) operations, ...

Improved fast deterministic algorithm for integer sorting in linear space improves the time bound given in [6], and the time complexity for sorting can be ...

In addition, we are able to stably sort n integers in the range 1..n on a deterministic CREW PRAM in O((log n)3/2) time with O(n(log n)1/2) operations and O(n) ...

Nov 21, 2024 · As a result, improved bounds for parallel integer sorting in the EREW PRAM model with standard and nonstandard word length are obtained.

Abstract. We show that n integers in the range 1 : : n can be sorted stably on an EREW PRAM using O(t) time and O(n( p log n log log n + (log n) 2 =t)) ...

We describe an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O(logk n log*(logk n) + loglogk).

Abstract. We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in the range f0;1;2; :::; m 1g in ...