coarse-grained distributed memory, parallel computers, parallel selection, load balancing
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. We demonstrate that the randomized algorithms are superior to their deterministic counterparts.
Al-Furaih, Ibraheem; Aluru, Srinivas; Goil, Sanjay; and Ranka, Sanjay, "Practical Algorithms for Selection on Coarse-Grained Parallel Computers" (1997). L.C. Smith College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects. Paper 29.