Loading...
conference paper
Indulgent Algorithms
2000
Proceeding of the 19th ACM Symposium on Principles of Distributed Computing
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.
Loading...
Name
IC_TECH_REPORT_200007.pdf
Access type
openaccess
Size
230.76 KB
Format
Adobe PDF
Checksum (MD5)
a96c16d84e5fae7db0f8fec59487dadc