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.
This work was supported in part by the National Science Foundation Grant NSF-MCS82-00269 and the Office of Naval Research Contract N00014.-80-C-0674.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Adleman, L., “On distinguishing prime numbers from composite numbers,” Annual Symposium of Foundations of Computer Science, 1980.
Adleman, L. and K. Manders, “Reducibility, randomness and intractability,” Proceedings of the 9th ACM Symposium on the Theory of Computing, 1977, pp. 151–153.
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.
Adleman, L. and Odlyzko, A., “Irreducibility testing and factorization of polynomials,” 22nd Annual Symposium on Foundations of Computer Science, 1981, pp. 409–420.
Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Pub. Comp., Reading, Mass., 1974.
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.
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.
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.
Berlekamp, E.R., “Factoring polynomials over large finite fields,” Math. Comp. 24 (1970), pp. 713–735.
Borodin, A., j. von zur Gothen, and J. Hopcroft, “Fast parallel matrix and gcd computations,” preliminary draft, 1981.
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.
Csanky, L., “Fast parallel matrix inversion algorithms,” SIAM J. Comput. 5 (1976), pp. 618–623.
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.
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.
Dymond, P., and S.A. Cook, “Hardware complexity and parallel computation,” IEEE FOCS Conference, 1980.
Feller, W., An Introduction to Probability Theory and its Applications, John Wiley, New York, 1957.
Freivalds, R., “Fast Probabilistic Algorithms,” 8th MFCS, 1979.
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.
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.
Gill, J., “Complexity of probabilistic Turing machines,” SIAM J. of Computing, 6 (4), 675–695 (1977).
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).
Hirschburg, D.S., A.K. Chandra, and D.V. Sarmate, “Computing connected components on parallel computors,” CACM 22 (8), Aug. 1978.
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.
Hopcroft, J.E., W. Paul, and L. Valiant, “On time versus space and related problems,” IEEE 16 SWAT, 1975.
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).
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.
Lovasz, L., “On determinants, matchings, and random algorithms,” to appear, 1980.
Rabin, M.O., “Probabilistic algorithms,” Algorithms and Complexity, New Directions and Recent Results, edited by J. Traub, Academic Press, 1974.
Rabin, M.O., “Probabilistic algorithms in finite fields,” SIAM J. Comp. 9(2), (May 1980), pp. 273–280.
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.
Reif, J.H., “Symmetric complementation,” 14th Annual ACM Symposium on Theory of Computing, San Francisco, May 1982.
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.
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.
Reif, J.H. and L.S. Valient, “Flashsort: An O(log n) time sorting algorithm for n process fixed connection networks,” to appear 1982.
Reischuk, R., “A fast probabilistic parallel sorting algorithm,” 22nd Annual Symposium on Foundations of Computer Science, Nashville, Tenn., Oct. 1981.
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.
Schwartz, J.T., “Fast probabilistic algorithms for verification of polynomial identities,” JACM 27(4), Oct. 1980, pp. 701–717.
Simon, J., “On some central problems in computational complexity,” TR75-224, Dept. of Computer Science, Cornell Univ., Ithaca, N.Y., 1975.
Solovay, R. and Strassen, V., “A fast Monte-Carlo test for primality,” SIAM J. of Computing 5(1), 1977, pp. 84–85.
Valiant, L.G., “A scheme for fast parallel communication,” Technical Report, Computer Science Dept., Edinburg University, Edinburg, Scotland, July 1980.
Wyllie, J.C., “The complexity of parallel computations,” Ph.D. Thesis and TR-79-387, Dept. of Computer Science, Cornell University, 1979.
Zippel, R., “Probabilistic algorithms for sparse polynomials,” EUROSAM Proceeding, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reif, J.H. (1982). On the power of probabilistic choice in synchronous parallel computations. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012790
Download citation
DOI: https://doi.org/10.1007/BFb0012790
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive