|
A General Perspective on Indulgent
Algorithms
Guerraoui & Lynch
Abstract
An indulgent algorithm is a distributed algorithm in which no process
ever knows about the operational status, correct or failed, of other processes.
Indulgent algorithms are robust because, besides tolerating process failures,
they also tolerate arbitrarily long periods of asynchrony where the absence
of bounds on communication delays typically leads to confuse correct processes
for failed ones. We give a simple yet general definition of indulgence
and highlight inherent properties and limitations of indulgent algorithms.
|
|
