Adaptive Bitonic Sorting: an Optimal Parallel Algorithm for Shared Memory Machines PDF Download

Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Adaptive Bitonic Sorting: an Optimal Parallel Algorithm for Shared Memory Machines PDF full book. Access full book title Adaptive Bitonic Sorting: an Optimal Parallel Algorithm for Shared Memory Machines by Gianfranco Bilardi. Download full books in PDF and EPUB format.

Adaptive Bitonic Sorting: an Optimal Parallel Algorithm for Shared Memory Machines

Adaptive Bitonic Sorting: an Optimal Parallel Algorithm for Shared Memory Machines PDF Author: Gianfranco Bilardi
Publisher:
ISBN:
Category : Parallel processing (Electronic computers)
Languages : en
Pages : 19

Get Book Here

Book Description
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[superscript]{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.