Skip to main content
SpringerLink
Log in

Optimal parallel algorithms for expression tree evaluation and list ranking

  • Parallel Tree Contraction
  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 319))

Included in the following conference series:

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.

This research was supported in part by NSF grants DCR-84-01633 and CCR-8702271, ONR grant N00014-85-K-0046 and by an IBM faculty development award.

This research was supported in part by NSF grants NSF-CCR-8615337 and NSF-DCR-8413359, ONR grant N00014-85-K-0046, by the Applied Mathematical Science subprogram of the office of Energy Research, U.S. Department of Energy under contract number DE-AC02-76ER03077, and by the Foundation for Research in Electronics, Computers and Communication, Administered by the Israeli Academy of Sciences and Humanities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.J. Anderson and G.L. Miller, Optimal parallel algorithms for list ranking, this proceedings.

    Google Scholar 

  2. R.P. Brent, "The parallel evaluation of general arithmetic expressions", J. ACM 21,2 (1974), 201–206.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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.

    Article  MATH  Google Scholar 

  4. R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control 70 (1986), 32–53.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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. 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. 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. 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. 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. 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. 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. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, JACM 30(1983), 853–865.

    Article  MathSciNet  Google Scholar 

  13. 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. 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. R.E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14,4 (1985), 862–874.

    Article  MATH  MathSciNet  Google Scholar 

  16. U. Vishkin, Synchronous parallel computation — a survey, TR 71, Dept. of Computer Science, Courant Institute, New York University, 1983.

    Google Scholar 

  17. U. Vishkin, On efficient parallel strong orientation, Information Processing Letters 20 (1985), 235–240.

    Article  MATH  MathSciNet  Google Scholar 

  18. S. Winograd, On the evaluation of certain arithmetic expressions, JACM 22(1975), 477–492.

    Article  MATH  MathSciNet  Google Scholar 

  19. 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 

Download references

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, New York University, USA

    Richard Cole & Uzi Vishkin

  2. Sackler Faculty of Exact Sciences, Tel Aviv University, Israel

    Richard Cole & Uzi Vishkin

Authors
  1. Richard Cole
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uzi Vishkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cole, R., Vishkin, U. (1988). Optimal parallel algorithms for expression tree evaluation and list ranking. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040377

Download citation

  • DOI: https://doi.org/10.1007/BFb0040377

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation