000089532 001__ 89532
000089532 005__ 20190316233822.0
000089532 037__ $$aCONF
000089532 245__ $$aA General Characterization of Indulgence (Invited Paper)
000089532 269__ $$a2006
000089532 260__ $$c2006
000089532 336__ $$aConference Papers
000089532 520__ $$aAn indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevocable action based on the operational status, correct or failed, of other processes. This paper presents an intuitive and general characterization of indulgence. The characterization can be viewed as a simple application of Murphy's law to partial runs of a distributed algorithm, in a 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.
000089532 700__ $$0240335$$aGuerraoui, Rachid$$g105326
000089532 700__ $$aLynch, Nancy
000089532 7112_ $$aEighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2006)$$cDallas, Texas, USA$$dNovember 17th-19th, 2006
000089532 773__ $$tProceedings of the Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems
000089532 8564_ $$s176995$$uhttps://infoscience.epfl.ch/record/89532/files/induAugustNew.pdf$$zn/a
000089532 909C0 $$0252114$$pDCL$$xU10407
000089532 909CO $$ooai:infoscience.tind.io:89532$$pconf$$pIC$$qGLOBAL_SET
000089532 937__ $$aLPD-CONF-2006-040
000089532 973__ $$aEPFL$$rREVIEWED$$sPUBLISHED
000089532 980__ $$aCONF