Parallel Tree Contraction

VLSI Algorithms and Architectures

Volume 319 of the series Lecture Notes in Computer Science pp 91-100

Date:

Optimal parallel algorithms for expression tree evaluation and list ranking

  • Richard ColeAffiliated withCourant Institute of Mathematical Sciences, New York UniversitySackler Faculty of Exact Sciences, Tel Aviv University
  • , Uzi VishkinAffiliated withCourant Institute of Mathematical Sciences, New York UniversitySackler Faculty of Exact Sciences, Tel Aviv University

* Final gross prices may vary according to local VAT.

Get Access

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.