A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System
[chapter]
2005
Lecture Notes in Computer Science
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is fully connected, we describe a way to transform any termination detection algorithm A that has been designed for a failure-free environment into a termination detection algorithm B that can tolerate process crashes. Our transformation assumes the existence of a perfect failure detector. We show that a perfect failure
doi:10.1007/11561927_9
fatcat:sn5thr34bbdqpgfblicbuiiajy