Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6609
 Title: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines Authors: Bilardi, GianfrancoNicolau, Alexandru Keywords: computer sciencetechnical report Issue Date: Aug-1986 Publisher: Cornell University Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-769 Abstract: 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. URI: http://hdl.handle.net/1813/6609 Appears in Collections: Computer Science Technical Reports

Files in This Item:

File Description SizeFormat