Distributed algorithms with random processor failures
George P. Papavassilopoulos · IEEE Transactions on Automatic Control · 1994
Examines a distributed algorithm where the processors may fail in a random fashion. This results in a model with random communication delays. Convergence conditions are derived. Extensions of the analysis and results to cases where the random processor failures are perceived and corrected within random time intervals are possible. For the sake of simplicity, the analysis is presented for a two processor model for solving a system of linear equations.>