Straggler-tolerant stationary methods for linear systems
Abstract
In this paper, we consider the iterative solution of linear algebraic equations under the condition that matrix-vector products with the coefficient matrix are computed only partially. At the same time, non-computed entries are set to zeros. We assume that both the number of computed entries and their associated row index set are random variables, with the row index set sampled uniformly given the number of computed entries. This model of computations is realized in hybrid cloud computing architectures following the controller-worker distributed model under the influence of straggling workers. We propose straggler-tolerant Richardson iteration scheme and Chebyshev semi-iterative schemes, and prove sufficient conditions for their convergence in expectation. Numerical experiments verify the presented theoretical results as well as the effectiveness of the proposed schemes on a few sparse matrix problems.
Cite
@article{arxiv.2407.01098,
title = {Straggler-tolerant stationary methods for linear systems},
author = {Vassilis Kalantzis and Yuanzhe Xi and Lior Horesh and Yousef Saad},
journal= {arXiv preprint arXiv:2407.01098},
year = {2024}
}