To the role of decomposition strategy in high parallel algorithms

DOI10.1108/03684920010342116zbMath0997.68169OpenAlexW2001527647MaRDI QIDQ2776831

Ivan Hanuliak

Publication date: 6 March 2002

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684920010342116

zbMATH Keywords

parallel computingdecomposition strategy

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Proving systolic systems correct
• Systolic designs for the root-squaring method
• Some Computer Organizations and Their Effectiveness

This page was built for publication: To the role of decomposition strategy in high parallel algorithms