Tree transformation problem in microparallelism algorithms

DOI10.1007/BF01068754MaRDI QIDQ3691058zbMATH OpenFDO

Authors G. P. Kozhevnikova, A. K. Sinitskij

Publication date 1983

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01068754

zbMATH Keywords

arithmetic expressioncomplete microparallelismlinear time algorithmparallel computationsortingtree transformations

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Extension of transition approach to parallel trees
• Efficient parallel algorithms for some tree layout problems
• scientific article; zbMATH DE number 1903379
• Solving parametric problems on trees
• scientific article; zbMATH DE number 4051021
• scientific article; zbMATH DE number 54593
• Planar tree transformation: results and counterexample
• scientific article; zbMATH DE number 3858451
• Tree-based parallel algorithm design
• A dynamic programming algorithm for the tree mapping problem

Cites work

• An axiomatic approach to code optimization for expressions
• Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity
• Computer programming as an art
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3304493 (Why is no real title available?)
• 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

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