A General Characterization of Indulgence

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates unreliable information about the interleaving of the processes. This article presents a general characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several results about the inherent power and limitations of indulgent algorithms.


Publié dans:
Acm Transactions On Autonomous And Adaptive Systems, 3, -
Année
2008
Mots-clefs:
Laboratoires:




 Notice créée le 2010-11-30, modifiée le 2018-12-03


Évaluer ce document:

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