Proceedings ArticleDOI
A fast probabilistic parallel sorting algorithm
Rüdiger Reischuk
- pp 212-219
Reads0
Chats0
TLDR
A probabilistic parallel algorithm to sort n keys drawn from some arbitrary total ordered set such that the average runtime is bounded by O(log n), which means the product of time and number of processors meets the information theoretic lower bound for sorting.Abstract:
We describe a probabilistic parallel algorithm to sort n keys drawn from some arbitrary total ordered set. This algorithm can be implemented on a parallel computer consisting of n RAMs, each with small private memory, and a common memory of size O(n) such that the average runtime is bounded by O(log n). Hence for this algorithm the product of time and number of processors meets the information theoretic lower bound for sorting.read more
Citations
More filters
Book ChapterDOI
Parallel Computational Geometry: An Approach using Randomization
John H. Reif,Sandeep Sen +1 more
TL;DR: Very general methods for designing efficient parallel algorithms for problems in computational geometry, including the PRAM, are described, providing strong evidence that these techniques yield equally efficient algorithms in more concrete computing models like Butterfly networks.
Book ChapterDOI
Randomized parallel computation
TL;DR: A survey of existing randomized parallel algorithms for many important problems is given in this article, followed by a procedure for deriving randomized parallel algorithm for selection and sorting for sorting both general and integer keys.
Journal ArticleDOI
Parallel sorting algorithm using multiway merge and its implementation on a multi-mesh network
Bhabani P. Sinha,Amar Mukherjee +1 more
TL;DR: A parallel sorting algorithm using the technique of multi-way merge, when implemented on a t dimensional mesh having nt nodes (t>2), sorts nt elements in O((t2−3t+2) n) time, thus offering a better order of time complexity than the [(( t2−t] n log n)/2+O(nt)]-time algorithm.
Proceedings ArticleDOI
The minimum reservation rate problem in digital audio/video systems
TL;DR: The authors present an O(n log n) randomized algorithm and a deterministic one to find the minimum rate at which data must be reserved on a shared storage system in order to provide continuous buffered play-back of a variable-rate output schedule.
References
More filters
Journal ArticleDOI
Parallelism in Comparison Problems
TL;DR: The worst-case time complexity of algorithms for multiprocessor computers with binary comparisons as the basic operations is investigated and the algorithm for finding the maximum is shown to be optimal for all values of k and n.
Journal ArticleDOI
Expected time bounds for selection
Robert W. Floyd,Ronald L. Rivest +1 more
TL;DR: A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically.
Journal ArticleDOI
New Parallel-Sorting Schemes
TL;DR: A family of parallel-sorting algorithms for a multiprocessor system that is enumeration sortings and includes the use of parallel merging to implement count acquisition, matching the performance of Hirschberg's algoithm, which, however, is not free of fetch conflicts.