Advertisement

Randomization in parallel algorithms and its impact on computational geometry

  • John H. Reif
  • Sandeep Sen
Conference paper
  • 159 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)

Abstract

Randomization offers elegant solutions to some problems in parallel computing. In addition to improved efficiency it often leads to simpler and practical algorithms. In this paper we discuss some of the characteristics of randomized algorithms and also give applications in computational geometry where use of randomization gives us significant advantage over the best known deterministic parallel algorithms.

Keywords

Failure Probability Parallel Algorithm Computational Geometry Deterministic Algorithm 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    L. Adleman and K. Manders, ‘Reducibility, Randomness and Untractability," Proc. 9th ACM STOC, 1977, pp. 151–163.Google Scholar
  2. [2]
    A. Aggarwal and R. Anderson, "A Random NC Algorithm for Depth First Search," Proc of the 19th ACM STOC, 1987, pp. 325–334.Google Scholar
  3. [3]
    Aggarwal et al., ‘Parallel Computational Geometry,’ Proc. of the 26th Annual Symp on F.O.C.S., 1985, pp. 468–477. Also appears in ALGORITHMICA, Vol. 3, No. 3, 1988, pp. 293–327.Google Scholar
  4. [4]
    Atallah, Cole and Goodrich, ‘Cascading Divide-and-conquer: A technique for designing parallel algorithms, Proc. of the 28th Annual Symp. on F.O.C.S., 1987, pp. 151–160.Google Scholar
  5. [5]
    Clarkson, ‘Applications of random sampling in Computational Geometry II,’ Proc. of the 4th Annual Symp. on Computational Geometry, June 1988, pp. 1–11.Google Scholar
  6. [6]
    N. Dadoun and D. Kirkpatrick, ‘Parallel Processing for efficient subdivision search,’ Proc. of the 3rd Annual Symp. on Computational Geometry, pp. 205–214, 1987.Google Scholar
  7. [7]
    H. Gazit, ‘An optimal randomized parallel algorithm for finding connected components in a graph,’ Proc of the IEEE FOCS, 1986, pp. 492–501.Google Scholar
  8. [8]
    C.A.R. Hoare, ‘Quicksort,’ Computer Journal, 5(1), 1962, pp.10–15.CrossRefGoogle Scholar
  9. [9]
    H. Karloff and P. Raghavan, ‘Randomized algorithms and Pseudorandom number generation,’ Proc. of the 20th Annual STOC, 1988.Google Scholar
  10. [10]
    G. Miller and J.H. Reif, ‘Parallel Tree contraction and its applications,’ Proc of the IEEE FOCS, 1985, pp. 478–489.Google Scholar
  11. [11]
    M.O. Rabin, ‘Probabilistic Algorithms,’ in: J.F. Traub, ed., Algorithms and Complexity, Academic Press, 1976, pp. 21–36.Google Scholar
  12. [12]
    S. Rajasekaran, ‘Randomized Parallel Computation,’ Ph.D. Thesis, Aiken Computing Lab, Harvard University, 1988.Google Scholar
  13. [13]
    J.H. Reif, ‘On synchronous parallel computations with independent probabilistic choice,’ SIAM J. Comput., Vol. 13, No. 1, Feb 1984, pp. 46–56.CrossRefGoogle Scholar
  14. [14]
    Reif and Sen, ‘Optimal randomized parallel algorithms for computational geometry,’ Proc. of the 16th Intl. Conf. on Parallel Processing, Aug 1987. Revised version available as Tech Rept CS-88-01, Computer Science Dept, Duke University.Google Scholar
  15. [15]
    J. Reif and S. Sen, ‘Polling: A new random sampling technique for Computational Geometry,’ Proc. of the 21st STOC, 1989.Google Scholar
  16. [16]
    J.H. Reif and L. Valiant, ‘A Logarithmic Time Sort for Linear Size networks,’ J. of ACM, Vol. 34, No.1, Jan '87, pp. 60–76.Google Scholar
  17. [17]
    R. Solovay and V. Strassen, ‘A fast Monte-Carlo test for primality,’ SIAM Journal of Computing, 1977, pp. 84–85.Google Scholar
  18. [18]
    L.G. Valiant, ‘A scheme for fast parallel communication,’ SIAM Journal of Computing, vol. 11, no. 2, 1982, pp. 350–361.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • John H. Reif
    • 1
  • Sandeep Sen
    • 1
  1. 1.Computer Science DepartmentDuke UniversityDurhamUSA

Personalised recommendations