Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines
Authors: Bilardi, Gianfranco
Nicolau, Alexandru
Keywords: computer science
technical report
Issue Date: Aug-1986
Publisher: Cornell University
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.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-769.pdf1.49 MBAdobe PDFView/Open
86-769.ps414.65 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us