The parallel evaluation of general arithmetic expressions

The parallel evaluation of general arithmetic expressions (1974)

by Richard P. Brent

Venue:	Journal of the ACM
Citations:	227 - 1 self

Datum	Value	Source
TITLE	The parallel evaluation of general arithmetic expressions	INFERENCE
AUTHOR NAME	Richard P. Brent	SVM HeaderParse 0.2
AUTHOR AFFIL	Australian Nalional University, Canberra	SVM HeaderParse 0.2
AUTHOR ADDR	Australia	SVM HeaderParse 0.2
ABSTRACT	ABSTRACT. It is shown that arithmetic expressions with n> 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log2n + 10(n- 1)/p using p> 1 processors which can independently perform arithmetic operations in unit time. This bound is within a constant factor of the best possible. A sharper result is given for expressions without the division operation, and the question of numerical stability is discussed. KEY WORDS AND PHRASES: arithmetic expressions, compilation of arithmetic expressions, compu-tational complexity, general arithmetic expressions, numerical stability, parallel computatioR,	SVM HeaderParse 0.2
YEAR	1974	INFERENCE
VENUE	Journal of the ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	201--206	INFERENCE
VOLUME	21	INFERENCE
CITATIONS	20 found	ParsCit 1.0