Fault-tolerant strassen-like matrix multiplication

Güney, Osman Berke and Oblokulov, Muhtasham and Arslan, Şuayb (2020) Fault-tolerant strassen-like matrix multiplication. In: 28th Signal Processing and Communications Applications Conference (SIU), Gaziantep, Turkey

Full text not available from this repository. (Request a copy)


In this study, we propose a simple method for fault-tolerant Strassen-like matrix multiplications. The proposed method is based on using two distinct Strassen-like algorithms instead of replicating a given one. We have realized that using two different algorithms, new check relations arise resulting in more local computations. These local computations are found using computer aided search. To improve performance, special parity (extra) sub-matrix multiplications (PSMMs) are generated (two of them) at the expense of increasing communication/computation cost of the system. Our preliminary results demonstrate that the proposed method outperforms a Strassen-like algorithm with two copies and secures a very close performance to three copy version using only 2 PSMMs, reducing the total number of compute nodes by around 24% i.e., from 21 to 16.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: Coded Matrix Multiplication; Fault-Tolerant Computation; Strassen-Like Algorithms
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Electronics
Faculty of Engineering and Natural Sciences
Depositing User: Osman Berke Güney
Date Deposited: 09 Aug 2023 14:32
Last Modified: 09 Aug 2023 14:32
URI: https://research.sabanciuniv.edu/id/eprint/46994

Actions (login required)

View Item
View Item