An 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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Guerraoui, R., & Lynch, N. (2006). A general characterization of indulgence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4280 LNCS, pp. 16–34). Springer Verlag. https://doi.org/10.1007/978-3-540-49823-0_2
Mendeley helps you to discover research relevant for your work.