000160241 001__ 160241
000160241 005__ 20181203022208.0
000160241 0247_ $$2doi$$a10.1145/1452001.1452010
000160241 02470 $$2ISI$$a000265879500009
000160241 037__ $$aARTICLE
000160241 245__ $$aA General Characterization of Indulgence
000160241 269__ $$a2008
000160241 260__ $$c2008
000160241 336__ $$aJournal Articles
000160241 520__ $$aAn 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.
000160241 6531_ $$aProcess failures
000160241 6531_ $$ascheduling failures
000160241 6531_ $$aagreement
000160241 6531_ $$aDistributed Systems
000160241 6531_ $$aFailure Detectors
000160241 6531_ $$aConsensus
000160241 6531_ $$aPrograms
000160241 700__ $$0240335$$g105326$$aGuerraoui, R.
000160241 700__ $$aLynch, N.
000160241 773__ $$j3$$tAcm Transactions On Autonomous And Adaptive Systems$$q-
000160241 909C0 $$xU10407$$0252114$$pDCL
000160241 909CO $$pIC$$particle$$ooai:infoscience.tind.io:160241
000160241 917Z8 $$xWOS-2010-11-30
000160241 937__ $$aEPFL-ARTICLE-160241
000160241 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000160241 980__ $$aARTICLE