Indulgent Algorithms

Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure detection: the algorithm is indulgent towards its failure detector. This paper formally characterizes such algorithms and states some of their interesting features. We show that indulgent algorithms are inherently safe and uniform. We also state impossibility results for indulgent solutions to divergent problems like consensus, and failure-sensitive problems like non-blocking atomic commit and terminating reliable broadcast.


Published in:
Proceeding of the 19th ACM Symposium on Principles of Distributed Computing
Presented at:
Symposium on Principles of Distributed Computing, Portland, Oregon, USA, July 16-19, 2000
Year:
2000
Laboratories:




 Record created 2005-07-13, last modified 2018-11-26

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)