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 λ.
Supported by the National Science Foundation under Grant DCR-8506361
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Anderson, R. J. and G. L. Miller, Optimal Parallel Algorithms for List Ranking, Extended Abstract, 1986.
Bar-On, I. and U. Vishkin, Optimal Parallel Generation of a Computation Tree Form, ACM Trans. Prog. Lang. and Sys. 7, pp. 348–357, 1985.
Cole, R. and U. Vishkin, Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking, Information and Control 70, pp. 32–53, 1986.
Cole, R. and U. Vishkin, The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time, TR, Courant Institute, June, 1987.
Gibbons, A. and W. Rytter, An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications, RR 77, Dept. of Computer Sci., Univ. of Warwick, April, 1986.
Miller, G. L. and J. H. Reif, Parallel Tree Contraction and Its Applications, Proc. 26th Symp. Found. Comp. Sci, pp. 478–489, 1985.
Miller, G. L., V. Ramachandran, and E. Kaltofen, Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits, Proc. Aegean Workshop on Computing, pp. 236–251, July, 1986.
Rytter, A., Remarks on Pebble Games on Graphs, Combinatorial Analysis and Its Application (ed. M. Syslo), 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao Kosaraju, S., Delcher, A.L. (1988). Optimal parallel evaluation of tree-structured computations by raking (extended abstract). 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/BFb0040378
Download citation
DOI: https://doi.org/10.1007/BFb0040378
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