To the role of decomposition strategy in high parallel algorithms

DOI10.1108/03684920010342116zbMATH Open0997.68169OpenAlexW2001527647MaRDI QIDQ2776831FDOQ2776831

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4070177
• scientific article; zbMATH DE number 4074468
• scientific article; zbMATH DE number 218074
• scientific article; zbMATH DE number 4201470
• Parallel complexity of matrix multiplication

zbMATH Keywords

parallel computingdecomposition strategy

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Some Computer Organizations and Their Effectiveness
• Proving systolic systems correct
• Systolic designs for the root-squaring method
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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