• DocumentCode
    1082045
  • Title

    Distributed algorithms with random processor failures

  • Author

    Papavassilopoulos, G.P.

  • Author_Institution
    Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
  • Volume
    39
  • Issue
    5
  • fYear
    1994
  • fDate
    5/1/1994 12:00:00 AM
  • Firstpage
    1032
  • Lastpage
    1036
  • Abstract
    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
  • Keywords
    convergence; distributed algorithms; matrix algebra; probability; random processes; convergence; distributed algorithm; linear equations; random communication delays; random processor failures; two processor model; Convergence; Delay effects; Distributed algorithms; Eigenvalues and eigenfunctions; Equations; Failure analysis; Stochastic processes; Vectors;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.284888
  • Filename
    284888
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1082045