About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of the ACM
Paper
On the Parallel Evaluation of Certain Arithmetic Expressions
Abstract
The time required to evaluate arithmetic expressions using parallel processing is investigated It is shown that for the evaluation of an arithmetic expression of n variables without division, in which every variable appears only once, at most 3n/2p + o(n) time umts are required if p processors are used In case the expression includes the division operation, the bound is raised to 5n/2p + o(n). © 1975, ACM. All rights reserved.