Advertisement

On the power of probabilistic choice in synchronous parallel computations

  • John H. Reif
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Abstract

This paper introduces probabilistic choice to synchronous parallel machine models; in particular parallel RAMs. The power of probabilistic choice in parallel computations is illustrated by parallelizing some known probabilistic sequential algorithms. We characterize the computational complexity of time, space, and processor bounded probabilistic prallel RAMs in terms of the computational complexity of probabilistic sequential RAMs. We show that parallelism uniformly speeds up time bounded probabilistic sequential RAM computations by nearly a quadratic factor. We also show that probabilistic choice can be, eliminated from parallel computations by introducing nonuniformity.

Keywords

Turing Machine Memory Location Probabilistic Choice Input String Computation Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L., “Two theorems on random polynomial time,” Proceedings of the 19th IEEE Symposium on the Foundations of Computer Science, Ann Arbor, MI, 1978, pp. 75–83.Google Scholar
  2. Adleman, L., “On distinguishing prime numbers from composite numbers,” Annual Symposium of Foundations of Computer Science, 1980.Google Scholar
  3. Adleman, L. and K. Manders, “Reducibility, randomness and intractability,” Proceedings of the 9th ACM Symposium on the Theory of Computing, 1977, pp. 151–153.Google Scholar
  4. Adleman, L., Manders, K., and G. Miller, “On taking roots in finite fields,” IEEE Symposium on the Foundations of Computer Science, 1977, pp. 175–178.Google Scholar
  5. Adleman, L. and Odlyzko, A., “Irreducibility testing and factorization of polynomials,” 22nd Annual Symposium on Foundations of Computer Science, 1981, pp. 409–420.Google Scholar
  6. Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Pub. Comp., Reading, Mass., 1974.zbMATHGoogle Scholar
  7. Aleliunas, R., R.M. Karp, R.H. Lipton, L. Lovasz and C. Rackoff, “Random walks, universal traversal sequences, and complexity of maze problems,” Proc. 20th Annual Symposium on Foundations of Computer Science, 1979, PP. 218–223.Google Scholar
  8. Barzdin, A.M., “On computability by probabilistic machines,” Dokl. Akad. Nauk SSSR, 189 (1969), pp. 699–702, = Soviet Math. Dokl., 10 (1969), pp. 1464–1467.MathSciNetzbMATHGoogle Scholar
  9. Bennett, C.H. and Gill, J., “Relative to a random oracle A, PA⊋ NPA⊋ coNPA with probability 1,” SIAM J. Comput. vol. 10, No. 1 (Feb. 1981), pp. 96–113.MathSciNetCrossRefGoogle Scholar
  10. Berlekamp, E.R., “Factoring polynomials over large finite fields,” Math. Comp. 24 (1970), pp. 713–735.MathSciNetCrossRefGoogle Scholar
  11. Borodin, A., j. von zur Gothen, and J. Hopcroft, “Fast parallel matrix and gcd computations,” preliminary draft, 1981.Google Scholar
  12. Cook, S.A., “Towards a complexity theory of synchronous parallel computation,” Presented at Internationales Symposium über Logik und Algorithmik zu Ehren von Professor Horst. Specker, Zürich, Switzerland, Feg. 1980.Google Scholar
  13. Csanky, L., “Fast parallel matrix inversion algorithms,” SIAM J. Comput. 5 (1976), pp. 618–623.MathSciNetCrossRefGoogle Scholar
  14. Chernoff, H., “A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,” Ann. of Math. Stat. 23 (1952), pp. 493–507.MathSciNetCrossRefGoogle Scholar
  15. Dymond, P.W., “Speedup of multi-tape Turing machines by synchronous parallel machines,” Technical Report, Dept. of EE and Computer Science, Univ. of California, San Diego, California.Google Scholar
  16. Dymond, P., and S.A. Cook, “Hardware complexity and parallel computation,” IEEE FOCS Conference, 1980.Google Scholar
  17. Feller, W., An Introduction to Probability Theory and its Applications, John Wiley, New York, 1957.zbMATHGoogle Scholar
  18. Freivalds, R., “Fast Probabilistic Algorithms,” 8th MFCS, 1979.CrossRefGoogle Scholar
  19. Fortune, S. and J. Wyllie, “Parallelism in random access machines,” In Proc. of the 10th ACM Symposium on Theory of Computation, 1978, pp. 114–118.Google Scholar
  20. Francez, N. and Rodeh, “A distributed data type implemented by a probabilistic communication scheme,” 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, Oct. 1980, pp. 373–379.Google Scholar
  21. Gill, J., “Complexity of probabilistic Turing machines,” SIAM J. of Computing, 6 (4), 675–695 (1977).MathSciNetCrossRefGoogle Scholar
  22. Goldschlager, L., “A unified approach to models of synchronous parallel machines,” In Proc. 10th Annual ACM Symposium on the Theory of Computing, San Diego, California, 89–94 (1978).Google Scholar
  23. Hirschburg, D.S., A.K. Chandra, and D.V. Sarmate, “Computing connected components on parallel computors,” CACM 22 (8), Aug. 1978.Google Scholar
  24. Hopcroft, J.E., and Karp, R.M., “An n5/2 algorithm for maximum matchings in bipartite graphs,” SIAM J. Comp. 2(4), (Dec. 1973), pp. 225–231.CrossRefGoogle Scholar
  25. Hopcroft, J.E., W. Paul, and L. Valiant, “On time versus space and related problems,” IEEE 16 SWAT, 1975.Google Scholar
  26. Iberra, O.H., and S. Moran, “Probabilistic algorithms for deciding equivalence of straight-line programs,” Computer Science Dept., University of Minnesota, Tech. Report 80-12 (March 1980).Google Scholar
  27. Lehman, D. and M. Rabin, “On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers' problem,” to appear in 8th ACM Symp. on Principles of Program Languages, Jan. 1981.Google Scholar
  28. Lovasz, L., “On determinants, matchings, and random algorithms,” to appear, 1980.Google Scholar
  29. Rabin, M.O., “Probabilistic algorithms,” Algorithms and Complexity, New Directions and Recent Results, edited by J. Traub, Academic Press, 1974.Google Scholar
  30. Rabin, M.O., “Probabilistic algorithms in finite fields,” SIAM J. Comp. 9(2), (May 1980), pp. 273–280.MathSciNetCrossRefGoogle Scholar
  31. Rabin, M.O., “N-process synchronization by a 4 log2N-valued shared variable,” 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, Oct. 1980, pp. 407–410.Google Scholar
  32. Reif, J.H., “Symmetric complementation,” 14th Annual ACM Symposium on Theory of Computing, San Francisco, May 1982.Google Scholar
  33. Reif, J.H. and P. Spirakis, “Distributed algorithms for synchronizing interprocess communication within real time,” 13th Annual ACM Symposium on the Theory of Computing, Milwaukee, Wisconsin, 1981.Google Scholar
  34. Reif, j.H. and P. Spirakis, “Unbounded speed variability in distributed communication systems,” 9th ACM Symposium on Principles of Programming Languages, Albuquerque, Ngw Mexico, Jan. 1982.Google Scholar
  35. Reif, J.H. and L.S. Valient, “Flashsort: An O(log n) time sorting algorithm for n process fixed connection networks,” to appear 1982.Google Scholar
  36. Reischuk, R., “A fast probabilistic parallel sorting algorithm,” 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tenn., Oct. 1981.Google Scholar
  37. Preporata, F.P. and D.V. Sarwate, “An improved parallel process-bound in fast matrix inversion,” Information Processing Letters V7(3), 1978, pp. 148–150.CrossRefGoogle Scholar
  38. Schwartz, J.T., “Fast probabilistic algorithms for verification of polynomial identities,” JACM 27(4), Oct. 1980, pp. 701–717.MathSciNetCrossRefGoogle Scholar
  39. Simon, J., “On some central problems in computational complexity,” TR75-224, Dept. of Computer Science, Cornell Univ., Ithaca, N.Y., 1975.Google Scholar
  40. Solovay, R. and Strassen, V., “A fast Monte-Carlo test for primality,” SIAM J. of Computing 5(1), 1977, pp. 84–85.MathSciNetCrossRefGoogle Scholar
  41. Valiant, L.G., “A scheme for fast parallel communication,” Technical Report, Computer Science Dept., Edinburg University, Edinburg, Scotland, July 1980.Google Scholar
  42. Wyllie, J.C., “The complexity of parallel computations,” Ph.D. Thesis and TR-79-387, Dept. of Computer Science, Cornell University, 1979.Google Scholar
  43. Zippel, R., “Probabilistic algorithms for sparse polynomials,” EUROSAM Proceeding, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • John H. Reif
    • 1
  1. 1.Aiken Computation Laboratory Division of Applied ScienceHarvard UniversityCambridgeUSA

Personalised recommendations