Finite termination of asynchronous iterative algorithms

S. A. Savari, D. P. Bertsekas

Research output: Contribution to journalArticlepeer-review

27 Scopus citations


We consider n-processor distributed systems where the ith processor executes asynchronously the iteration xi = fi(x). It is natural to terminate the iteration of the ith processor when some local condition, such as xi = fi(x): 'small', holds. However, local termination conditions of this type may not lead to global termination because of the asynchronous character of the algorithm. In this paper, we propose several approaches to modify the original algorithm and/or supplement it with an interprocessor communication protocol so that this difficulty does not arise. Some of the resulting procedures can be recast as termination detection schemes for arbitrary finite, distributed computations.

Original languageEnglish (US)
Pages (from-to)39-56
Number of pages18
JournalParallel Computing
Issue number1
StatePublished - Jan 1996
Externally publishedYes


  • Asynchronous iterative methods
  • Distributed memory multiprocessor
  • Linear algebra
  • Message-passing system
  • Termination detection

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence


Dive into the research topics of 'Finite termination of asynchronous iterative algorithms'. Together they form a unique fingerprint.

Cite this