Randomized parallel computation

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


This paper surveys randomized parallel algorithms found in the literature for various problems in computer science. In particular we will demonstrate the power of randomization as a tool for parallelizing sequential algorithms and introduce the reader to some of the techniques employed in designing randomized parallel algorithms. We consider representative problems from the following areas of computer science and describe how randomized parallel algorithms for these problems have been obtained: 1)routing and sorting, 2)processor load balancing, 3)algebra, and 4)graph theory. Finally we discuss methods of derandomizing randomized parallel algorithms.


Parallel Algorithm Depth First Search Boolean Circuit Arithmetic Expression Pram Model 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. • [AA86]
    Aggarwal,A., and Anderson,R., ‘A Random NC Algorithm for Depth First Search,'to appear in Proc. of the 19th annual ACM Symposium on Theory Of Computing, 1987.Google Scholar
  2. • [AHMP85]
    Alt,H., Hagerup,T., Mehlhorn,K., and Preparata,F.P., 'simulation of Idealized Parallel Computers on more Realistic ones,’ Preliminary Report.Google Scholar
  3. • [AHU74]
    Aho, A.U., Hopcroft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, Massachusetts, 1977.Google Scholar
  4. • [AKS83]
    Ajtai, M., Komlós, J., and Szemerédi, E., ‘An O(n log n) Sorting Network,’ Combinatorica, 3, 1983. pp. 1–19.Google Scholar
  5. • [AM77]
    Adleman,L., and Manders,K., ‘Reducibility, Randomness and Untractability,’ Proc. 9th ACM Symposium on Theory Of Computing, 1977. pp. 151–163.Google Scholar
  6. • [Ba68]
    Batcher,K.E., 'sorting Networks and their Applications,’ Proc. 1968 Spring Joint Computer Conference, vol.32, AFIPS Press, 1968. pp.307–314.Google Scholar
  7. • [Br74]
    Brent, R.P., ‘The Parallel Evaluation of Generalized Arithmetic Expressions,’ Journal of ACM, vol.21, no.2, 1974. pp. 201–208.Google Scholar
  8. • [Co86]
    Cole,R., ‘Parallel Merge Sort,’ Proceedings of the IEEE Foundations Of Computer Science, 1986. pp. 511–516.Google Scholar
  9. • [CV86]
    Cole,R., and Vishkin,U., ‘Approximate and Exact Parallel Scheduling with Applications to List, Tree, and Graph Problems,’ Proc. of the IEEE Foundations Of Computer Science, 1986. pp. 478–491.Google Scholar
  10. • [CW79]
    Carter, L., and Wegman, M., ‘Universal Class of Hash Functions,’ Journal of CSS, vol.18, no.2, 1979, pp. 143–154.Google Scholar
  11. • [De74]
    Deo, N., Graph Theory with Applications to Engineering and Computer Science, Prentice Hall Publishing Company, New York, 1974.Google Scholar
  12. • [EA77]
    Eckstein,D., and Alton,D., ‘Parallel Graph Processing using Depth First Search,’ Proc. Conference on Theoretical Computer Science at Univ. of Waterloo, 1977. pp. 21–29.Google Scholar
  13. • [Fe68]
    Feller, W., An Introduction to Probability Theory and its Applications, John Wiley & sons Publishing Company, New York, 1968.Google Scholar
  14. • [Fr79]
    Freivalds, ‘Fast Probabilistic Algorithms,’ 8th MFCS, 1979.Google Scholar
  15. • [FW78]
    Fotune,S., and Wyllie,J., ‘Parallelism in Random Access Machines,’ Proc. 10th Annual ACM Symposium on Theory Of Computing, 1978. pp. 114–118.Google Scholar
  16. • [Ga86]
    Gazit,H., ‘An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph,’ Proc. Foundations Of Computer Science conference, 1986. pp. 492–501.Google Scholar
  17. • [GB84]
    Ghosh, R.K., and Bhattacharjee, G.P., ‘A Parallel Search Algorithm for Directed Acyclic Graphs,’ BIT, vol.24, 1984. pp. 134–150.Google Scholar
  18. • [Ha69]
    Harary, F., Graph Theory, Addison-Wesley Publications, Massachusetts, 1969.Google Scholar
  19. • [Ho62]
    Hoare, C.A.R., ‘Quicksort,’ Computer Journal, vol.5, no.1, 1962. pp. 10–15.Google Scholar
  20. • [Kn81]
    Knuth, D.E., The Art of Computer Programming, vol.2, Seminumerical Algorithms, Addison-Wesley Publications, Massachusetts,1981.Google Scholar
  21. • [KU86]
    Karlin,A.R., and Upfal,E., ‘Parallel Hashing-An Efficient Implementation of Shared Memory,’ Proc. 18th Annual ACM Symposium on Theory Of Computing, 1986. pp. 160–168.Google Scholar
  22. • [KUW85]
    Karp,R.M., Upfal,E., and Wigderson,A., ‘The Complexity of Parallel Computation on Matroids,’ IEEE Symposium on Foundations Of Computer Science, 1985. pp. 541–550.Google Scholar
  23. • [KW84]
    Karp,R.M., and Wigderson,A., ‘A Fast Parallel Algorithm for the Maximal Independent Set Problem,’ Proc. 16th Annual ACM Symposium on Theory Of Computing, 1984. pp. 266–272.Google Scholar
  24. • [Le84]
    Leighton,T., ‘Tight Bounds on the Complexity of Parallel Sorting,’ Proc. 16th Annual ACM Symposium on Theory Of Computing, 1984. pp. 71–80.Google Scholar
  25. • [Lu85]
    Luby,M., ‘A Simple Parallel Algorithm for the Maximal Independent Set Problem,’ Proc. 17th Annual ACM Symposium on Theory Of Computing, 1985. pp. 1–10.Google Scholar
  26. • [MR85]
    Miller,G.L., Reif,J.H., ‘Parallel Tree Contraction and its Applications,’ Proc. IEEE conference on Foundations Of Computer Science, 1985. pp. 478–489.Google Scholar
  27. • [Pi84]
    Pippenger,N., ‘Parallel Communication with Limited Buffers,’ Proc. IEEE Symposium on Foundations Of Computer Science, 1984. pp. 127–136.Google Scholar
  28. • [Ra76]
    Rabin, M.O., ‘Probabilistic Algorithms,’ in: Traub, J.F., ed., Algorithms and Complexity, Academic Press, New York, 1976. pp. 21–36.Google Scholar
  29. • [Re83]
    Reif, J.H., ‘Depth First Search is Inherently Sequential,’ Information Processing Letters, vol.20, no.5, June 1985, pp. 229–234.Google Scholar
  30. • [Re84]
    Reif, J.H., ‘On Synchronous Parallel Computations with Independent Probabilistic Choice,’ SIAM Journal on Computing, vol.13, no.1, 1984. pp. 46–56.Google Scholar
  31. • [Re184]
    Reif, J.H., ‘Symmetric Complementation,’ Journal of the ACM, vol.31, no.2, 1984. pp. 401–421.Google Scholar
  32. • [Re85]
    Reif, J.H., ‘Optimal Parallel Algorithms for Integer Sorting and Graph Connectivity,’ Technical Report TR-08-85, Aiken Computing Lab., Harvard University, Cambridge, Mass. 02138, 1985.Google Scholar
  33. • [RND77]
    Reingold, E., Nievergelt, J., and Deo, N., Combinatorial Algorithms: Theory and Practice, Prentice Hall Publishing Company, New York, 1977.Google Scholar
  34. • [Reis81]
    Reischuk,R., ‘A Fast Probabilistic Parallel Sorting Algorithm,’ Proc. IEEE Symposium on Foundations Of Computer Science, 1981. pp. 212–219.Google Scholar
  35. • [RR84]
    Rajasekaran,S., and Reif,J.H., ‘Derivation of Randomized Algorithms,’ Aiken Computing Lab: Technical Report TR-16-84, 1984.Google Scholar
  36. • [RR85]
    Rajasekaran,S., and Reif,J.H., ‘Optimal and Sub-Logarithmic Time Sorting Algorithms,’ Aiken Computing Lab. Technical Report, 1985. Also appeared as ‘An Optimal Parallel Algorithm for Integer Sorting,’ in the Proc. of the IEEE Symposium on FOCS, 1985. pp. 496–503.Google Scholar
  37. [RT85]
    Reif,J.H., and Tygar,J.D., ‘Efficient Parallel Psuedo-Random Number Generation,’ Aiken Computing Lab. Technical Report, 1984.Google Scholar
  38. [RV82]
    Reif,J.H., and Valiant,L.G., ‘A Logarithmic Time Sort for Linear Size Networks,’ Proc. of the 15th Annual Symposium on Theory of Computing, 1983, pp. 10–16, also to appear in JACM 1987.Google Scholar
  39. [Sm84]
    Smith,J.R., ‘Parallel Algorithms for Depth First Searches: I. Planar Graphs,’ International Conference on Parallel Processing, 1984.Google Scholar
  40. [SS76]
    Solovay, R., and Strassen, V., ‘A Fast Monte-Carlo Test for Primality,’ SIAM Journal of Computing, vol.6, 1977. pp. 84–85.Google Scholar
  41. [SV83]
    Shiloach, Y., and Vishkin, U., ‘An O(log n) Parallel Connectivity Algorithm,’ Journal of Algorithms, volume 3, 1983. pp. 57–67.Google Scholar
  42. [Tu47]
    Tutte, W.T., ‘The Factorization of Linear Graphs,’ Journal of the London Mathematical Society, vol.22, 1947. pp. 107–111.Google Scholar
  43. [Up84]
    Upfal, E., ‘Efficient Schemes for Parallel Communication,’ Journal of the ACM, vol.31, no.3, 1984. pp. 507–517.Google Scholar
  44. [Va75]
    Valiant, L.G., ‘Parallelism in Comparison Problems,’ SIAM Journal of Computing, vol.14, 1985. pp. 348–355.Google Scholar
  45. [Va82]
    Valiant, L.G., ‘A Scheme for Fast Parallel Communication,’ SIAM Journal of Computing, vol.11, no.2, 1982. pp. 350–361.Google Scholar
  46. [Vo71]
    Voorhis, V., ‘On Sorting Networks,’ Ph.D. Thesis, Stanford University CS department, 1971.Google Scholar
  47. [We83]
    Welsh, D.J.A., ‘Randomized Algorithms,’ Discrete Applied Mathematics, vol.5, 1983. pp. 133–145.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Sanguthevar Rajasekaran
    • 1
  • John H. Reif
    • 2
  1. 1.Aiken Computing Lab.Harvard UniversityUSA
  2. 2.Department of Computer ScienceDuke UniversityUSA

Personalised recommendations