On the computability power and the robustness of set agreement-oriented failure detector classes

摘要

Solving agreement problems deterministically, such as consensus and k-set agreement, in asynchronous distributed systems prone to an unbounded number of process failures has been shown to be impossible. To circumvent this impossibility, unreliable failure detectors for the crash failure model have been widely studied. These are oracles that provide information on failures. The exact nature of such information is defined by a set of abstract properties that a particular class of failure detectors satisfy. The weakest class of such failure detectors that allow to solve consensus is Ω. This paper considers failure detector classes from the literature that solve k-set agreement in the crash failure model, and studies their relative power. It shows that the family of failure detector classes ◇S_x (1 ≤ x ≤ n), and ◇ψ~y (0 ≤ y ≤ n), can be "added" to provide a failure detector of the class Ω~z (1 ≤ z ≤ n, a generalization of Ω). It also characterizes the power of such an "addition", namely, ◇S_x+ ◇ψz~y ～ Ω~z reversible x + y + z > t + 1, ◇ψ~y can construct Ω~z iff y +z > t, and ◇S_x can construct Ω~z iff x + z > t + 1, where t is the maximum number of processes that can crash in a run. As an example, the paper shows that, while ◇S_t allows solving 2-set agreement (but not consensus) and ◇ψ~1 allows solving t-set agreement (but not (t - 1)-set agreement), a system with failure detectors of both classes can solve consensus for any value of t. More generally, the paper studies the failure detector classes ◇S_x, ◇ψ~y and Ω~z, and shows which reductions among these classes are possible and which are not. The paper also presents a message-passing Ω~k-based k-set agreement protocol and shows that Ω~k is not enough to solve (k - 1)-set agreement. In that sense, it can be seen as a step toward the characterization of the weakest failure detector class that allows solving the k-set agreement problem.