Finite termination of asynchronous iterative algorithms

S. A. Savari; D. P. Bertsekas

doi:10.1016/0167-8191(95)00059-3

Finite termination of asynchronous iterative algorithms

S. A. Savari, D. P. Bertsekas

Research output: Contribution to journal › Article › peer-review

27 Scopus citations

Abstract

We consider n-processor distributed systems where the ith processor executes asynchronously the iteration x_i = f_i(x). It is natural to terminate the iteration of the ith processor when some local condition, such as x_i = f_i(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 language	English (US)
Pages (from-to)	39-56
Number of pages	18
Journal	Parallel Computing
Volume	22
Issue number	1
DOIs	https://doi.org/10.1016/0167-8191(95)00059-3
State	Published - Jan 1996
Externally published	Yes

Keywords

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

Access to Document

10.1016/0167-8191(95)00059-3

Cite this

@article{7b83f35c7c5d494ba941d6d422eaae78,

title = "Finite termination of asynchronous iterative algorithms",

abstract = "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.",

keywords = "Asynchronous iterative methods, Distributed memory multiprocessor, Linear algebra, Message-passing system, Termination detection",

author = "Savari, {S. A.} and Bertsekas, {D. P.}",

note = "Funding Information: {\textquoteright} Supported by an AT & T Bell Laboratories GRPW Fellowship. {\textquoteright} Supported by NSF under Grant 9300494-DMI, and the AR0",

year = "1996",

month = jan,

doi = "10.1016/0167-8191(95)00059-3",

language = "English (US)",

volume = "22",

pages = "39--56",

journal = "Parallel Computing",

issn = "0167-8191",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Finite termination of asynchronous iterative algorithms

AU - Savari, S. A.

AU - Bertsekas, D. P.

N1 - Funding Information: ’ Supported by an AT & T Bell Laboratories GRPW Fellowship. ’ Supported by NSF under Grant 9300494-DMI, and the AR0

PY - 1996/1

Y1 - 1996/1

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

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

KW - Asynchronous iterative methods

KW - Distributed memory multiprocessor

KW - Linear algebra

KW - Message-passing system

KW - Termination detection

UR - http://www.scopus.com/inward/record.url?scp=0029736203&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029736203&partnerID=8YFLogxK

U2 - 10.1016/0167-8191(95)00059-3

DO - 10.1016/0167-8191(95)00059-3

M3 - Article

AN - SCOPUS:0029736203

SN - 0167-8191

VL - 22

SP - 39

EP - 56

JO - Parallel Computing

JF - Parallel Computing

IS - 1

ER -

Finite termination of asynchronous iterative algorithms

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this