Finite termination of asynchronous iterative algorithms

We consider n-processor distributed systems where the ith processor executes asynchronously the iteration xi = ƒi,(x). It is natural to terminate the iteration of the ith processor when some local condition, such as xiƒi(x): ‘small’, holds. However, local termination conditions of this type may not...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Parallel computing Ročník 22; číslo 1; s. 39 - 56
Hlavní autori: Savari, S.A., Bertsekas, D.P.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.01.1996
Predmet:
Asynchronous iterative methods
Distributed memory multiprocessor
Linear algebra
Message-passing system
Termination detection
Asynchronous iterative methods
Message-passing system
Termination detection
Distributed memory multiprocessor
Linear algebra
ISSN:0167-8191, 1872-7336
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We consider n-processor distributed systems where the ith processor executes asynchronously the iteration xi = ƒi,(x). It is natural to terminate the iteration of the ith processor when some local condition, such as xiƒ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.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-8191
1872-7336
DOI:10.1016/0167-8191(95)00059-3