Optimal parallel evaluation of tree-structured computations by raking (extended abstract)

S. Rao Kosaraju, Arthur L. Delcher

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show that any arithmetic expression of size n can be evaluated on an EREW PRAM with O(n/log n) processors in O (log n) steps. A major contribution is the simplicity of the algorithm. In contrast with existing algorithms which require independent RAKE and COMPRESS operations, our algorithm combines the RAKE and COMPRESS into one simple operation. In fact, our algorithm can be viewed as avoiding COMPRESSes entirely and simply performing RAKEs. The algorithm can be modified easily to evaluate every subexpression of the original arithmetic expression. We also show how it can be applied to the following problem: Given a positive constant λ and a tree with weighted nodes, partition the tree into minimal components subject to the constraint that the sum of the node weights in each component is at least λ.

Original languageEnglish (US)
Title of host publicationVLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings
PublisherSpringer Verlag
Pages101-110
Number of pages10
Volume319 LNCS
ISBN (Print)9780387968186
DOIs
StatePublished - Jan 1 1988
Event3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 - Corfu, Greece
Duration: Jun 28 1988Jul 1 1988

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume319 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988
CountryGreece
CityCorfu
Period6/28/887/1/88

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimal parallel evaluation of tree-structured computations by raking (extended abstract)'. Together they form a unique fingerprint.

  • Cite this

    Rao Kosaraju, S., & Delcher, A. L. (1988). Optimal parallel evaluation of tree-structured computations by raking (extended abstract). In VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings (Vol. 319 LNCS, pp. 101-110). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 319 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0040378