Minimal parallelism for associative computations under time constraints

DOI10.1007/BF02253123MaRDI QIDQ1137382zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 3602678 (Why is no real title available?)
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• On the Parallel Evaluation of Certain Arithmetic Expressions
• On the time required for a sequence of matrix products
• Optimal algorithms for parallel polynomial evaluation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137382)