Practical Algorithms for Selection on Coarse-Grained Parallel Computers

Authors:
Ibraheem Al-Furaih;Srinivas Aluru;Sanjay Goil;Sanjay Ranka
Affiliations:
-;-;-;-
Venue:
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Year:
1996

Citing 5
Cited 1

Deterministic selection in O(loglog N) parallel time

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Unifying Themes for Network Selection

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Many-to-many personalized communication with bounded traffic

FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Time bounds for selection

Journal of Computer and System Sciences

Implementation and Results of Hypothesis Testing from the C3I Parallel Benchmark Suite

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. Experimental results on the CM-5 demonstrate that randomized algorithms are superior to their deterministic counterparts.