Parallel selection by regular sampling

Authors:
Alexander Tiskin
Affiliations:
Department of Computer Science, University of Warwick, Coventry, UK
Venue:
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Year:
2010

Citing 15
Cited 0

A bridging model for parallel computation

Communications of the ACM
Parallel sorting by regular sampling

Journal of Parallel and Distributed Computing
Practical Algorithms for Selection on Coarse-Grained Parallel Computers

IEEE Transactions on Parallel and Distributed Systems
The bulk-synchronous parallel random access machine

Theoretical Computer Science - Special issue on parallel computing
Selecting the Median

SIAM Journal on Computing
Models for Parallel and Distributed Computation: Theory, Algorithmic Techniques, and Applications

Models for Parallel and Distributed Computation: Theory, Algorithmic Techniques, and Applications
Optimal parallel selection

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Progress in Selection

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Parallel Convex Hull Computation by Generalised Regular Sampling

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Architecture independent parallel selection with applications to parallel priority queues

Theoretical Computer Science
Parallel Scientific Computation: A Structured Approach Using BSP and MPI

Parallel Scientific Computation: A Structured Approach Using BSP and MPI
An improved, randomized algorithm for parallel selection with an experimental study

Journal of Parallel and Distributed Computing
Deterministic parallel selection algorithms on coarse-grained multicomputers

Concurrency and Computation: Practice & Experience
Time bounds for selection

Journal of Computer and System Sciences
Finding the median

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bulk-synchronous parallelism (BSP) is a simple and efficient paradigm for parallel algorithm design and analysis. In this paper, we present a new simple deterministic BSP algorithm for the classical problem of selecting the k-th smallest element from an array of size n, for a given k, on a parallel computer with p processors. Our algorithm is based on the technique of regular sampling. It runs in optimal O(n/p) local computation and communication, and near-optimal O(log log p) synchronisation. The algorithm is of theoretical interest, as it gives an improvement in the asymptotic synchronisation cost over its predecessors. It is also simple enough to be implementable.