Abstract
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.
This author was supported by ONR Contract N00014-80-C-0647 and NSF grant DCR-85-03251
This author was also supported by the same sponsors
Preview
Unable to display preview. Download preview PDF.
References
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.
Alt,H., Hagerup,T., Mehlhorn,K., and Preparata,F.P., 'simulation of Idealized Parallel Computers on more Realistic ones,’ Preliminary Report.
Aho, A.U., Hopcroft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, Massachusetts, 1977.
Ajtai, M., Komlós, J., and Szemerédi, E., ‘An O(n log n) Sorting Network,’ Combinatorica, 3, 1983. pp. 1–19.
Adleman,L., and Manders,K., ‘Reducibility, Randomness and Untractability,’ Proc. 9th ACM Symposium on Theory Of Computing, 1977. pp. 151–163.
Batcher,K.E., 'sorting Networks and their Applications,’ Proc. 1968 Spring Joint Computer Conference, vol.32, AFIPS Press, 1968. pp.307–314.
Brent, R.P., ‘The Parallel Evaluation of Generalized Arithmetic Expressions,’ Journal of ACM, vol.21, no.2, 1974. pp. 201–208.
Cole,R., ‘Parallel Merge Sort,’ Proceedings of the IEEE Foundations Of Computer Science, 1986. pp. 511–516.
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.
Carter, L., and Wegman, M., ‘Universal Class of Hash Functions,’ Journal of CSS, vol.18, no.2, 1979, pp. 143–154.
Deo, N., Graph Theory with Applications to Engineering and Computer Science, Prentice Hall Publishing Company, New York, 1974.
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.
Feller, W., An Introduction to Probability Theory and its Applications, John Wiley & sons Publishing Company, New York, 1968.
Freivalds, ‘Fast Probabilistic Algorithms,’ 8th MFCS, 1979.
Fotune,S., and Wyllie,J., ‘Parallelism in Random Access Machines,’ Proc. 10th Annual ACM Symposium on Theory Of Computing, 1978. pp. 114–118.
Gazit,H., ‘An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph,’ Proc. Foundations Of Computer Science conference, 1986. pp. 492–501.
Ghosh, R.K., and Bhattacharjee, G.P., ‘A Parallel Search Algorithm for Directed Acyclic Graphs,’ BIT, vol.24, 1984. pp. 134–150.
Harary, F., Graph Theory, Addison-Wesley Publications, Massachusetts, 1969.
Hoare, C.A.R., ‘Quicksort,’ Computer Journal, vol.5, no.1, 1962. pp. 10–15.
Knuth, D.E., The Art of Computer Programming, vol.2, Seminumerical Algorithms, Addison-Wesley Publications, Massachusetts,1981.
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.
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.
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.
Leighton,T., ‘Tight Bounds on the Complexity of Parallel Sorting,’ Proc. 16th Annual ACM Symposium on Theory Of Computing, 1984. pp. 71–80.
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.
Miller,G.L., Reif,J.H., ‘Parallel Tree Contraction and its Applications,’ Proc. IEEE conference on Foundations Of Computer Science, 1985. pp. 478–489.
Pippenger,N., ‘Parallel Communication with Limited Buffers,’ Proc. IEEE Symposium on Foundations Of Computer Science, 1984. pp. 127–136.
Rabin, M.O., ‘Probabilistic Algorithms,’ in: Traub, J.F., ed., Algorithms and Complexity, Academic Press, New York, 1976. pp. 21–36.
Reif, J.H., ‘Depth First Search is Inherently Sequential,’ Information Processing Letters, vol.20, no.5, June 1985, pp. 229–234.
Reif, J.H., ‘On Synchronous Parallel Computations with Independent Probabilistic Choice,’ SIAM Journal on Computing, vol.13, no.1, 1984. pp. 46–56.
Reif, J.H., ‘Symmetric Complementation,’ Journal of the ACM, vol.31, no.2, 1984. pp. 401–421.
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.
Reingold, E., Nievergelt, J., and Deo, N., Combinatorial Algorithms: Theory and Practice, Prentice Hall Publishing Company, New York, 1977.
Reischuk,R., ‘A Fast Probabilistic Parallel Sorting Algorithm,’ Proc. IEEE Symposium on Foundations Of Computer Science, 1981. pp. 212–219.
Rajasekaran,S., and Reif,J.H., ‘Derivation of Randomized Algorithms,’ Aiken Computing Lab: Technical Report TR-16-84, 1984.
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.
Reif,J.H., and Tygar,J.D., ‘Efficient Parallel Psuedo-Random Number Generation,’ Aiken Computing Lab. Technical Report, 1984.
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.
Smith,J.R., ‘Parallel Algorithms for Depth First Searches: I. Planar Graphs,’ International Conference on Parallel Processing, 1984.
Solovay, R., and Strassen, V., ‘A Fast Monte-Carlo Test for Primality,’ SIAM Journal of Computing, vol.6, 1977. pp. 84–85.
Shiloach, Y., and Vishkin, U., ‘An O(log n) Parallel Connectivity Algorithm,’ Journal of Algorithms, volume 3, 1983. pp. 57–67.
Tutte, W.T., ‘The Factorization of Linear Graphs,’ Journal of the London Mathematical Society, vol.22, 1947. pp. 107–111.
Upfal, E., ‘Efficient Schemes for Parallel Communication,’ Journal of the ACM, vol.31, no.3, 1984. pp. 507–517.
Valiant, L.G., ‘Parallelism in Comparison Problems,’ SIAM Journal of Computing, vol.14, 1985. pp. 348–355.
Valiant, L.G., ‘A Scheme for Fast Parallel Communication,’ SIAM Journal of Computing, vol.11, no.2, 1982. pp. 350–361.
Voorhis, V., ‘On Sorting Networks,’ Ph.D. Thesis, Stanford University CS department, 1971.
Welsh, D.J.A., ‘Randomized Algorithms,’ Discrete Applied Mathematics, vol.5, 1983. pp. 133–145.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajasekaran, S., Reif, J.H. (1987). Randomized parallel computation. In: Budach, L., Bukharajev, R.G., Lupanov, O.B. (eds) Fundamentals of Computation Theory. FCT 1987. Lecture Notes in Computer Science, vol 278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18740-5_79
Download citation
DOI: https://doi.org/10.1007/3-540-18740-5_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18740-0
Online ISBN: 978-3-540-48138-6
eBook Packages: Springer Book Archive