Removing randomness in parallel computation without a processor penalty

Some general techniques are developed for removing randomness from randomized NC algorithms without a blowup in the number of processors. One of the requirements for the application of these techniques is that the analysis of the randomized algorithm uses only pairwise independence. The main new result is a parallel algorithm for the Delta +1 vertex coloring problem with running time O(log/sup 3/ nlog log n) using a linear number of processors on a concurrent-read-concurrent-write parallel random-access machine. The techniques also apply to several other problems, including the maximal-independent-set problem and the maximal-matching problem. The application of the general technique to these last two problems is mostly of academic interest, because NC algorithms using a linear number of processors that have better running times have been previously found.<<ETX>>

[1]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[2]  Bonnie Berger,et al.  Efficient NC algorithms for set cover with applications to learning and geometry , 1989, 30th Annual Symposium on Foundations of Computer Science.

[3]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4]  Moni Naor,et al.  The probabilistic method yields deterministic parallel algorithms , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Mark K. Goldberg,et al.  A new parallel algorithm for the maximal independent set problem , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[6]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[7]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[9]  Amos Israeli,et al.  An Improved Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[10]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[11]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[12]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[13]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

[15]  C. D. Litton,et al.  Theory of Probability (3rd Edition) , 1984 .

[16]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[17]  M. Fischer,et al.  Parallel Prefix Computation , 1980, J. ACM.

[18]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[19]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[20]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[21]  A. Joffe.  On a Set of Almost Deterministic $k$-Independent Random Variables , 1974 .

[22]  H. O. Lancaster.  Pairwise Statistical Independence , 1965 .

[23]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[24]  C. R. Rao,et al.  Factorial Experiments Derivable from Combinatorial Arrangements of Arrays , 1947 .

[25]  L. M. M.-T..  Theory of Probability , 1929, Nature.

[26]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .