Distributed algorithms with random processor failures

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 ran...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 1994-05, Vol.39 (5), p.1032-1036
Main Author: Papavassilopoulos, G.P.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Convergence
Delay effects
Distributed algorithms
Eigenvalues and eigenfunctions
Equations
Exact sciences and technology
Failure analysis
Software
Stochastic processes
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:0018-9286
1558-2523
DOI:10.1109/9.284888