Practical Algorithms for Selection on Coarse-Grained Parallel Computers


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… (More)
DOI: 10.1109/IPPS.1996.508074


1 Figure or Table

Slides referencing similar topics