On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup

DOI10.1109/T-C.1972.223501zbMath0248.65030OpenAlexW2114876342MaRDI QIDQ5661080

S. C. Chen, Yoichi Muraoka, David Kuck

Publication date: 1972

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1972.223501

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Roundoff error (65G50)

Related Items (8)

Parallel preconditioners for monolithic solution of shear bands ⋮ Synthesis and equivalence of concurrent systems ⋮ On the adequacy of dependence-based representations for programs with heaps ⋮ Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity ⋮ Detection of parallelism between statements by decomposing into separate sequential processes ⋮ Efficient comparison of program slices ⋮ The parallel execution of loops: The parallelepiped method ⋮ Tree transformation problem in microparallelism algorithms

This page was built for publication: On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup