000052338 001__ 52338
000052338 005__ 20190812204827.0
000052338 037__ $$aCONF
000052338 245__ $$aIndulgent Algorithms
000052338 269__ $$a2000
000052338 260__ $$c2000
000052338 336__ $$aConference Papers
000052338 520__ $$aInformally, 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.
000052338 700__ $$g105326$$aGuerraoui, Rachid$$0240335
000052338 7112_ $$dJuly 16-19, 2000$$cPortland, Oregon, USA$$aSymposium on Principles of Distributed Computing
000052338 773__ $$tProceeding of the 19th ACM Symposium on Principles of Distributed Computing
000052338 8564_ $$zn/a$$uhttps://infoscience.epfl.ch/record/52338/files/IC_TECH_REPORT_200007.pdf$$s236301
000052338 909C0 $$xU10407$$pDCL$$0252114
000052338 909CO $$ooai:infoscience.tind.io:52338$$qGLOBAL_SET$$pconf$$pIC
000052338 917Z8 $$x166927
000052338 937__ $$aLPD-CONF-2000-001
000052338 937__ $$aLPD-REPORT-2000-008
000052338 970__ $$a200007/IC
000052338 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000052338 980__ $$aCONF