Distributed asynchronous computation of fixed points

Research output: Contribution to journalArticlepeer-review

145 Scopus citations


We present an algorithmic model for distributed computation of fixed points whereby several processors participate simultaneously in the calculations while exchanging information via communication links. We place essentially no assumptions on the ordering of computation and communication between processors thereby allowing for completely uncoordinated execution. We provide a general convergence theorem for algorithms of this type, and demonstrate its applicability to several classes of problems including the calculation of fixed points of contraction and monotone mappings arising in linear and nonlinear systems of equations, optimization problems, shortest path problems, and dynamic programming.

Original languageEnglish (US)
Pages (from-to)107-120
Number of pages14
JournalMathematical Programming
Issue number1
StatePublished - Sep 1983
Externally publishedYes


  • Distributed Algorithm
  • Dynamic Programming
  • Fixed Points
  • Optimization
  • Shortest Path

ASJC Scopus subject areas

  • Software
  • Mathematics(all)


Dive into the research topics of 'Distributed asynchronous computation of fixed points'. Together they form a unique fingerprint.

Cite this