Distributed asynchronous algorithms

Dimitri P. Bertsekas, John N. Tsitsiklis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

The authors consider iterative algorithms of the form x := f(x), executed by a distributed network of processors. They first discuss a few possibilities for synchronous execution. They then consider asynchronous implementations whereby each processor iterates on a different component of x, at its own pace, using the most recently received (but possibly outdated) information on the remaining components of x. While certain algorithms may fail to converge when implemented asynchronously, a large number of positive convergence results are available. The authors classify asynchronous algorithms into three main categories, depending on the amount of asynchronism they can tolerate, and survey the corresponding convergence results.

Original languageEnglish (US)
Title of host publicationProc 1988 IEEE Int Conf Syst Man Cybern
Editors Anon
Pages591-593
Number of pages3
StatePublished - 1988
Externally publishedYes
EventProceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics - Beijing/Shenyang, China
Duration: Aug 8 1988Aug 12 1988

Publication series

NameProc 1988 IEEE Int Conf Syst Man Cybern

Conference

ConferenceProceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics
CityBeijing/Shenyang, China
Period8/8/888/12/88

ASJC Scopus subject areas

  • Engineering(all)

Cite this