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

• Type: Conference
• Year: 1996
• Where: IPPS
• Authors: Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka
• Keywords: Coarse-grained Distributed Memory, Distributed And Parallel Computing, IPPS 1996, Parallel Selection, Randomized Algorithms