Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity
From MaRDI portal
Publication:1216179
DOI10.1007/BF00288634zbMath0303.68032OpenAlexW2024151750MaRDI QIDQ1216179
Publication date: 1974
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288634
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Time Bounds on the Parallel Evaluation of Arithmetic Expressions
- The Parallel Evaluation of General Arithmetic Expressions
- An empirical study of FORTRAN programs
- An axiomatic approach to code optimization for expressions
- On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
- On the Parallel Evaluation of Polynomials
- The Parallel Evaluation of Arithmetic Expressions Without Division
This page was built for publication: Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity