Optimal parallel generation of a computation tree form

Authors:
Ilan Bar-on;Uzi Vishkin
Affiliations:
Courant Institute of Mathematical Sciences;Tel Aviv Univ., Tel Aviv, Israel
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Year:
1985

Citing 10
Cited 7

The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
On the Parallel Evaluation of Certain Arithmetic Expressions

Journal of the ACM (JACM)
Parallel Generation of Postfix and Tree Forms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient parallel algorithms for some graph problems

Communications of the ACM
Parallel Dictionaries in 2-3 Trees

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Optimal Parallel Pattern Matching in Strings (Extended Summary)

Proceedings of the 12th Colloquium on Automata, Languages and Programming
Randomized speed-ups in parallel computation

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Optimal parallel algorithms for string matching

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The Complexity of Parallel Computations

The Complexity of Parallel Computations

A practical parallel algorithm for solving band symmetric positive definite systems of linear equations

ACM Transactions on Mathematical Software (TOMS)
Highly parallelizable problems

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Parallel Parsing of Arithmetic Expressions

IEEE Transactions on Computers
Optimal routing of parentheses on the hypercube

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A bibliography on parallel parsing

ACM SIGPLAN Notices
Efficient EREW PRAM Algorithms for Parentheses-Matching

IEEE Transactions on Parallel and Distributed Systems
A new Parallel Algorithm for the Parentheses-Matching Problem

PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, exclusive-write, parallel random-access machine.A new algorithm is introduced for this purpose. Unlike previous serial and parallel solutions, it is not based on using a stack.