Optimal parallel algorithms for expression tree evaluation and list ranking

  • Richard Cole
  • Uzi Vishkin
Parallel Tree Contraction
Part of the Lecture Notes in Computer Science book series (LNCS, volume 319)

Abstract

Two related results are presented. The first is a simple n/log n processor, O(log n) time parallel algorithm for list ranking. The second is a general parallel algorithmic technique for computations on trees; it yields the first n/log n processor, O(log n) time deterministic parallel algorithm for expression tree evaluation, and solves many other tree problems within the same complexity bounds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AM-88]
    R.J. Anderson and G.L. Miller, Optimal parallel algorithms for list ranking, this proceedings.Google Scholar
  2. [B-74]
    R.P. Brent, "The parallel evaluation of general arithmetic expressions", J. ACM 21,2 (1974), 201–206.MATHMathSciNetCrossRefGoogle Scholar
  3. [BV-85]
    I. Bar-On and U. Vishkin, Optimal parallel generation of a computation tree form, ACM Trans. on Prog. Lang. and Sys. 7,2 (1985), 348–357.MATHCrossRefGoogle Scholar
  4. [CV-86a]
    R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control 70 (1986), 32–53.MATHMathSciNetCrossRefGoogle Scholar
  5. [CV-86b]
    R. Cole and U. Vishkin, Approximate and exact parallel scheduling with applications to list, tree and graph problems, Proc. 27th Symp. on Foundations of Computer Science, 1986, 478–491.Google Scholar
  6. [CV-86c]
    R. Cole and U. Vishkin, The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Computer Science Department Technical Report #242, Courant Institute, 1986.Google Scholar
  7. [CV-87]
    R. Cole and U. Vishkin, "Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time", to appear, SIAM Journal on Computing.Google Scholar
  8. [GPS-87]
    A. Goldberg, S. Plotkin, and G. Shannon, "Parallel symmetry-breaking in sparse graphs", Nineteenth Annual ACM Symp. on Theory of Computing, 315–224.Google Scholar
  9. [GMT-87]
    H. Gazit, G. Miller and S. H. Teng, Optimal tree contraction in EREW model, manuscript, Computer Science Department, University of Southern California.Google Scholar
  10. [GR-86]
    A. Gibbons and W. Rytter, An optimal parallel algorithm for dynamic tree expression evaluation and its applications, Research Report 77, Dept. of Computer Science, Univ. of Warwick, Coventry, CV4 7AL, England, 1986.Google Scholar
  11. [H-86]
    X. He, The general tree algebraic computations and its applications in parallel algorithms design, preprint, 1986, Dept. of Computer and Information Science, Ohio State University, Columbus, OH 43210.Google Scholar
  12. [Me-83]
    N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, JACM 30(1983), 853–865.MathSciNetCrossRefGoogle Scholar
  13. [MR-85]
    G.L. Miller and J.H. Reif, Parallel tree contraction and its applications, Proc. 26th Symp. on Foundations of Computer Science, 1985, 478–489.Google Scholar
  14. [R-85]
    J.H. Reif, An optimal parallel algorithm for integer sorting, Proc. 26th Symp. on Foundations of Computer Science, 1985, 496–503, to appear SIAM J. Comput.Google Scholar
  15. [TV-85]
    R.E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14,4 (1985), 862–874.MATHMathSciNetCrossRefGoogle Scholar
  16. [Vi-83]
    U. Vishkin, Synchronous parallel computation — a survey, TR 71, Dept. of Computer Science, Courant Institute, New York University, 1983.Google Scholar
  17. [Vi-85]
    U. Vishkin, On efficient parallel strong orientation, Information Processing Letters 20 (1985), 235–240.MATHMathSciNetCrossRefGoogle Scholar
  18. [Wi-75]
    S. Winograd, On the evaluation of certain arithmetic expressions, JACM 22(1975), 477–492.MATHMathSciNetCrossRefGoogle Scholar
  19. [W-79]
    J.C. Wyllie, "The Complexity of Parallel Computation", Ph.D. thesis, TR 79-387, Dept. of Computer Science, Cornell Univ., Ithaca, NY, 1979.Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Richard Cole
    • 1
    • 2
  • Uzi Vishkin
    • 1
    • 2
  1. 1.Courant Institute of Mathematical SciencesNew York UniversityUSA
  2. 2.Sackler Faculty of Exact SciencesTel Aviv UniversityIsrael

Personalised recommendations