The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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.</p>
Coarse-grained, hypercubes, load balancing, median finding, meshes, randomized algorithms, selection, parallel algorithms, parallel computers.

S. Goil, S. Aluru, I. Al-furiah and S. Ranka, "Practical Algorithms for Selection on Coarse-Grained Parallel Computers," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 813-824, 1997.
93 ms
(Ver 3.3 (11022016))