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.


Publié dans:
Proceeding of the 19th ACM Symposium on Principles of Distributed Computing
Présenté à:
Symposium on Principles of Distributed Computing, Portland, Oregon, USA, July 16-19, 2000
Année
2000
Laboratoires:




 Notice créée le 2005-07-13, modifiée le 2019-08-12

n/a:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)