Random Sampling Techniques in Parallel Computation

Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are efficient in practice. We will focus on the use of random sampling in fundamental problems such as sorting, selection, list ranking and graph connectivity.

[1]  Margaret Reid-Miller,et al.  List ranking and list scan on the Cray C-90 , 1994, SPAA '94.

[2]  Uri Zwick,et al.  Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems , 1996, SODA '96.

[3]  Guy E. Blelloch,et al.  Scans as Primitive Parallel Operations , 1989, ICPP.

[4]  Rüdiger Reischuk.  Probabilistic Parallel Algorithms for Sorting and Selection , 1985, SIAM J. Comput..

[5]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[6]  John Greiner,et al.  A comparison of parallel algorithms for connected components , 1994, SPAA '94.

[7]  Guy E. Blelloch,et al.  NESL: A Nested Data-Parallel Language (Version 2.6) , 1993 .

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

[9]  Guy E. Blelloch,et al.  Vector Models for Data-Parallel Computing , 1990 .

[10]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[11]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

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

[13]  Baruch Awerbuch,et al.  New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM , 1987, IEEE Transactions on Computers.

[14]  Richard Cole,et al.  Finding minimum spanning forests in logarithmic time and linear work using random sampling , 1996, SPAA '96.

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

[16]  John H. Reif,et al.  An optimal parallel algorithm for integer sorting , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[17]  Philip N. Klein,et al.  A randomized linear-time algorithm for finding minimum spanning trees , 1994, STOC '94.

[18]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[19]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[20]  John H Reif.  Optimal Parallel Algorithms for Interger Sorting and Graph Connectivity. , 1985 .

[21]  D. Karger,et al.  Random sampling in graph optimization problems , 1995 .