On Detecting Termination in the Crash-Recovery Model

We investigate the problem of detecting termination of a distributed computation in an asynchronous message-passing system where processes may crash and recover. We show that it is impossible to solve the termination detection problem in this model. We identify necessary and sufficient conditions under which it is possible to solve the stabilizing version of the problem in which a termination detection algorithm is allowed to make finite number of mistakes. Finally, we present an algorithm to solve the stabilizing termination detection problem under these conditions.

• Type: Conference
• Year: 2007
• Where: EUROPAR
• Authors: Felix C. Freiling, Matthias Majuntke, Neeraj Mittal
• Keywords: Distributed Computation, EUROPAR 2007, Termination Detection Algorithm, Termination Detection Problem