Optimal parallel algorithms for expression tree evaluation and list ranking

  • Richard Cole
  • Uzi Vishkin
Parallel Tree Contraction

DOI: 10.1007/BFb0040377

Part of the Lecture Notes in Computer Science book series (LNCS, volume 319)
Cite this paper as:
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

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.

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