Proceedings ArticleDOI
A fast probabilistic parallel sorting algorithm
Rüdiger Reischuk
- pp 212-219
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
Journal ArticleDOI
Randomized algorithms: An annotated bibliography: In alphabetical order
Proceedings ArticleDOI
Qureshi Sort: A new Sorting Algorithm
TL;DR: A new sorting algorithm that has best & average cases between O (3N) & O (4N) and for worst case it may be O (N2) or more swear both in speed and memory, but it has a great property to tell its worst case in the starting iteration loop so that it can be switched to other Sorting Algorithms in worst cases.
Posted Content
Sorted Top-k in Rounds
TL;DR: The techniques can be generally useful for understanding the trade-off between round complexities and sample complexities of rank aggregation problems.
Proceedings ArticleDOI
The complexity of parallel comparison merging
Mihaly Gereb-Graus,Danny Krizanc +1 more
TL;DR: A worst case lower bound of Ω(log log n) is proved for randomized algorithms merging two sorted lists of length n in parallel using n processors on Valiant's parallel computation tree model.
Book
Design and Analysis of Algorithms: A Contemporary Perspective
Sandeep Sen,Amit Kumar +1 more
TL;DR: In this paper, the authors cover important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and give applications to contemporary problems such as skip-lists and dimensionality reduction.
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.