, Volume 3, Issue 1–4, pp 329–346 | Cite as

The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

  • Richard Cole
  • Uzi Vishkin


A new general parallel algorithmic technique for computations on trees is presented. In particular, it provides the firstn/logn processor,O(logn)-time deterministic EREW PRAM algorithm for expression tree evaluation. The technique solves many other tree problems within the same complexity bounds.

Key words

Expression tree Parallel algorithm PRAM Centroid decomposition List ranking 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AM-88]
    R. J. Anderson and G. L. Miller, Deterministic parallel list ranking, to appear, Aegean Workshop on Computing, Corfu, 1988.Google Scholar
  2. [BV-85]
    I. Bar-On and U. Vishkin, Optimal parallel generation of a computation tree form,ACM Trans. Prog. Lang. Sys.,7, 2 (1985), 348–357.zbMATHCrossRefGoogle Scholar
  3. [CV-86]
    R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking,Inform, and Control,70 (1986), 32–53.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [CV-88]
    R. Cole and U. Vishkin, Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time,SIAM J. Comput.,17, 1 (1988), 128–142.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [CV-87]
    R. Cole and U. Vishkin, Faster optimal parallel prefix sums and list ranking, Technical Report No. 277, Courant Institute, New York University, 1987; to appear,Inform, and Computation.Google Scholar
  6. [GMT-88]
    H. Gazit, G. L. Miller, and S.-H. Teng, Optimal tree contraction in the EREW model, to appear,Princeton Workshop Book, Plenum, New York.Google Scholar
  7. [GR-86]
    A. Gibbons and W. Rytter, An optimal parallel algorithm for dynamic tree expression evaluation and its applications, Research Report 77, Department of Computer Science, University of Warwick, Coventry CV47AL, 1986.Google Scholar
  8. [H-86]
    X. He, The general tree algebraic computations and its applications in parallel algorithms design, Preprint, Department of Computer and Information Science, Ohio State University, Columbus, OH 43210, 1986.Google Scholar
  9. [Me-83]
    N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms,J. Assoc. Comput. Mach.,30 (1983), 852–865.zbMATHMathSciNetGoogle Scholar
  10. [MR-85]
    G. L. Miller and J. H. Reif, Parallel tree contraction and its applications,Proc. 26th Symp. on Foundations of Computer Science, 1985, pp. 478–489; to appear asParallel Tree Contraction. Part 1: Fundamentals, Randomness, and Computation (S. Micali, ed.), JAI Press, Greenwich, CT;Parallel Tree Contraction. Part 2: Further Applications, submitted for publication.Google Scholar
  11. [R-85]
    J. H. Reif, An optimal parallel algorithm for integer sorting,Proc. 26th Symp. on Foundations of Computer Science, 1985, pp. 496–503; to appear,SIAM J. Comput.Google Scholar
  12. [TV-85]
    R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm,SIAM J. Comput.,14, 4 (1985), 862–874.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [Vi-83]
    U. Vishkin, Synchronous parallel computation—a survey, Technical Report No. 71, Department of Computer Science, Courant Institute, New York University, 1983.Google Scholar
  14. [Vi-85]
    U. Vishkin, On efficient parallel strong orientation,Inform. Process. Lett.,20 (1985), 235–240.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [Wi-75]
    S. Winograd, On the evaluation of certain arithmetic expressions,J. Assoc. Comput. Mach.,22 (1975), 477–492.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Richard Cole
    • 1
  • Uzi Vishkin
    • 2
  1. 1.Department of Computer Science, Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA
  2. 2.Computer Science Department, Sackler Faculty of Exact SciencesTel Aviv UniversityTel AvivIsrael

Personalised recommendations