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

[1]  Sanguthevar Rajasekaran,et al.  Derivation of Randomized Sorting and Selection Algorithms , 1993 .

[2]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Guy E. Blelloch,et al.  Prefix sums and their applications , 1990 .

[5]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[6]  Richard Cole,et al.  A Parallel Median Algorithm , 1985, Inf. Process. Lett..

[7]  János Komlós,et al.  Deterministic selection in O(loglog N) parallel time , 1986, STOC '86.

[8]  Bruce M. Maggs,et al.  Sorting-based selection algorithms for hypercubic networks , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[9]  Ernst W. Mayr,et al.  Efficient computation on sparse interconnection networks , 1989 .

[10]  Sanjay Ranka,et al.  Random Data Accesses on a Coarse-Grained Parallel Machine II: One-to-One, Many-to-One Mappings , 1997, J. Parallel Distributed Comput..

[11]  Selim G. Akl.  An Optimal Algorithm for Parallel Selection , 1984, Inf. Process. Lett..

[12]  Quentin F. Stout,et al.  Selection on the reconfigurable mesh , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[13]  Sartaj Sahni,et al.  Load balancing on a hypercube , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[14]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[15]  Sanjay Ranka,et al.  Many-to-many personalized communication with bounded traffic , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.

[16]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.

[17]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[18]  Sanguthevar Rajasekaran,et al.  Unifying Themes for Network Selection , 1994, ISAAC.

[19]  Srinivas Aluru,et al.  Practical Algorithms for Selection on Coarse-Grained Parallel Computers , 1997, IEEE Trans. Parallel Distributed Syst..

[20]  Xin He,et al.  Efficient parallel algorithms for selection and searching on sorted matrices , 1992, Proceedings Sixth International Parallel Processing Symposium.

[21]  Sanguthevar Rajasekaran.  Randomized Parallel Selection , 1990, FSTTCS.

[22]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[23]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

[24]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[25]  David A. Bader,et al.  Practical parallel algorithms for dynamic data redistribution, median finding, and selection , 1995, Proceedings of International Conference on Parallel Processing.

[26]  Sartaj Sahni,et al.  Programming a hypercube multicomputer , 1988, IEEE Software.