Distributed Termination Detection by Counting Agent.
Natalia Olegovna Garanina, Evgeny V. Bodin · 2014
Abstract. The detection of termination of a distributed computation is an important problem in distributed systems. A distributed computa-tion is said to terminate when all its processes are passive and there is no unprocessed message in the communication channels. We suggest a new algorithm for the distributed termination detection (DTD) problem. Our algorithm exploits a special agent that accumulates knowledge about the activities of basic system processes, and can decide about system termi-nation. This approach combines the benets of both message-counting and credit/recovery DTD-algorithms. We prove correctness of this algo-rithm and introduce some signicant modications. 1