Minimal parallelism for associative computations under time constraints

DOI10.1007/BF02253123zbMath0428.68054MaRDI QIDQ1137382

S. H. Smith

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

parallel computationparallel processorstime-constrained evaluation of general arithmetic expressions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Optimal algorithms for parallel polynomial evaluation
• On the Parallel Evaluation of Certain Arithmetic Expressions
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• On the time required for a sequence of matrix products

This page was built for publication: Minimal parallelism for associative computations under time constraints