Infoscience

Similar records
Conference paper

Indulgent Algorithms

Guerraoui, Rachid
  • Presented at: Symposium on Principles of Distributed Computing
  • Published in: PoDC
  • Publication date: 2000

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.

Reference

  • LPD-CONF-2000-001

Record created on 2005-07-13, modified on 2012-03-20

Fulltext

Contacts

EPFL authors