An optimal algorithm for parallel selection
Information Processing Letters
Deterministic selection in O(loglog N) parallel time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Introduction to algorithms
An introduction to parallel algorithms
An introduction to parallel algorithms
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Practical parallel algorithms for dynamic data redistribution, median finding, and selection (preliminary draft)
Expected time bounds for selection
Communications of the ACM
Programming a Hypercube Multicomputer
IEEE Software
Efficient Parallel Algorithms for Selection and Searching on Sorted Matrices
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Unifying Themes for Network Selection
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Many-to-many personalized communication with bounded traffic
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Efficient computation on sparse interconnection networks
Efficient computation on sparse interconnection networks
Parallel Construction of Multidimensional Binary Search Trees
IEEE Transactions on Parallel and Distributed Systems
Parallel Implementations of the Selection Problem: A Case Study
International Journal of Parallel Programming
An improved, randomized algorithm for parallel selection with an experimental study
Journal of Parallel and Distributed Computing
Parallel selection by regular sampling
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
| Hi-index | 0.00 |
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. We also consider several algorithms for load balancing needed to keep a balanced distribution of data across processors during the execution of the selection algorithms. We have carried out detailed implementations of all the algorithms discussed on the CM-5 and report on the experimental results. The results clearly demonstrate the role of randomization in reducing communication overhead.