Fault-tolerant strassen-like matrix multiplication

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.Sponsor : Istanbul Medipol UnivWOS:000653136100356Conference Proceedings Citation Index – Science (CPCI-S)Proceedings PaperUluslararası işbirliği ile yapılmayan - HAYIROctober2020YÖK - 2020-2