Tree transformation problem in microparallelism algorithms
From MaRDI portal
Publication:3691058
DOI10.1007/BF01068754zbMath0573.68012MaRDI QIDQ3691058
G. P. Kozhevnikova, A. K. Sinitskij
Publication date: 1983
Published in: Cybernetics (Search for Journal in Brave)
sortingparallel computationtree transformationslinear time algorithmarithmetic expressioncomplete microparallelism
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity
- Computer programming as an art
- An axiomatic approach to code optimization for expressions
- On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
This page was built for publication: Tree transformation problem in microparallelism algorithms