Optimal parallel algorithms for polygon and point-set problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Constructing arrangements optimally in parallel (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Java annotation-aware just-in-time (AJIT) complilation system
JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
Intererence analysis tools for parallelizing programs with recursive data structures
ICS '89 Proceedings of the 3rd international conference on Supercomputing
Formal engineering of the bitonic sort using PVS
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
Sorting on GPUs for large scale datasets: A thorough comparison
Information Processing and Management: an International Journal
| Hi-index | 0.01 |
We propose a parallel algorithm, called adaptive bitonic sorting, which runs on a PRAC, a shared-memory multiprocessor where fetch and store conflicts are disallowed. On a $P$ processors PRAC, our algorithm achieves optimal performance $TP = O(N \log N)$, for any computation time $T$ in the range $\Omega (\log^{2} N) \leq T \leq O(N \log N)$. Adaptive bitonic sorting has also a small constant factor, since it performs less than $2N \log N$ comparisons, and only a handful of operations per comparison.