AN ALGORITHM FOR SOLVING THE DISTRIBUTED TERMINATION DETECTION PROBLEM
作者:
G. ALOISIO,
P. BERALDI,
M. CAFARO,
F. GUERRIERO,
R. MUSMANNO,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1999)
卷期:
Volume 14,
issue 2
页码: 149-164
ISSN:1063-7192
年代: 1999
DOI:10.1080/10637199808947383
出版商: Taylor & Francis Group
关键词: Distributed system;Message passing;Distributed termination;MPI
数据来源: Taylor
摘要:
In this paper we present an algorithm for solving the distributed termination detection problem. In particular, a strategy based on message counting is used to detect the termination of a distributed computation consisting of a set of processes asynchronously communicating over communication links. The proposed algorithm does not require the FIFO property for the communication links. The assumptions regarding the connectivity of the processes are very simple. For the proposed algorithm we demonstrate the correctness, we evaluate the message and the bit complexity and we give a detailed description of a MPI implementation.
点击下载:
PDF (425KB)
返 回