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
Proceedings ArticleDOI
Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
Neeraj Sharma,Sandeep Sen +1 more
TL;DR: In this paper, a cache-oblivious framework for randomized divide and conquer algorithms on the multicore model with private cache is presented, where the number of processors, the size of an individual cache memory and the block size are assumed to be fixed.
Journal ArticleDOI
Partially effective randomization in simulations between arbitrary and common PRAMs
TL;DR: It is shown that one step of ARBITRARY can be simulated by O(log m/k(log log m-log k) + log log n) steps on randomized COMMON with error-rate n-c, where m = n/k is the number of different memory cells into which at least one processor of the simulated PRAM attempts to write.
Journal ArticleDOI
Parallel Algorithmic Techniques for Combinatorial Computation
TL;DR: A number of algorithmic tools have been found useful in the construction of parallel algorithms; among these are prefix computation, ranking, Euler tours, ear decomposition, and matrix calculations.
Posted Content
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
Neeraj Sharma,Sandeep Sen +1 more
TL;DR: A cache-oblivious framework for randomized divide and conquer algorithms on the multicore model with private cache and a simple randomized processor allocation technique without the explicit knowledge of the number of processors that is likely to find additional applications in resource oblivious environments are presented.
Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range
TL;DR: A matching lOwer-bound for these problems in the bounded degree decision tree is proved for some-fundamental problems like convexhulls and trapezoidal decomposition which execute in time O(Iogn/log1:) in an n1: (1: > 1) processor CRCW PRAM.
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.