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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 319 LNCS, Issue , 1988, Pages 101-110

  Rao Kosaraju, S ^a   Delcher, Arthur L ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; VLSI CIRCUITS;

ARITHMETIC EXPRESSION; EXTENDED ABSTRACTS; FOLLOWING PROBLEM; PARALLEL EVALUATION; POSITIVE CONSTANT; SIMPLE OPERATION; TREE STRUCTURED COMPUTATIONS; WEIGHTED NODES;

COMPUTER ARCHITECTURE;

EID: 0345745380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0040378     Document Type: Conference Paper

References (8)

1. Anderson, R. J. and G. L. Miller, Optimal Parallel Algorithms for List Ranking, Extended Abstract, 1986.
2. 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.
3. Cole, R. and U. Vishkin, Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking, Information and Control 70, pp. 32–53, 1986.
4. Cole, R. and U. Vishkin, The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time, TR, Courant Institute, June, 1987.
5. 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.
6. Miller, G. L. and J. H. Reif, Parallel Tree Contraction and Its Applications, Proc. 26th Symp. Found. Comp. Sci, pp. 478–489, 1985.
7. 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.
8. Rytter, A., Remarks on Pebble Games on Graphs, Combinatorial Analysis and Its Application (ed. M. Syslo), 1985.