Jun 1, 2005 · 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.
Abstract. We show that any arithmetic expression of size n can be evaluated on an. EREW PRAM with 0 (n/log n) processors in 0 (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 ...
Contents. VLSI Algorithms and Architectures. Optimal parallel evaluation of tree-structured computations by raking (extended abstract). Pages 101 - 110 ...
A major contribution is the simplicity of the algorithm. In contrast with existing algorithms which require independent RAKE and COMPRESS operations, our ...
Optimal parallel evaluation of tree-structured computation by ranking (Extended Abstract), in VLSI Algorithms and Architectures: 3rd Aegean Workshop on ...
We present an optimal parallel algorithm (log2 n time, n/log2 n processors) for computing the matching function for a sequence of brackets and for ...
Given a general arithmetic expression, we find a computation binary tree representation in O(log n) time using n/log n processors on a concurrent-read, ...
Missing: Raking. | Show results with:Raking.
Optimal parallel evaluation of tree-structured computation by raking. Proc. AWOC 88, VLSI Algorithms and Architectures, Corfu, Greece, Springer-Verlag ...
Optimal parallel evaluation of tree- structured computations by raking (extended abstract), pages 101–110. 1988. [35] John H. Reif and Stephen R. Tate ...