Determining consensus number
Reading group: Minh Tung Nguyen presented "Determining consensus number" (PODC'97) at 4A312 the 7/6/2024 at 10h30.
Abstract
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objeets of type T and registers. The conditions apply to two large classes of deterministic shared objects: read-modify-write objects [15] and readable objects, which have operations that allow processes to read the state of the object. These classes include most objects that are used as the primitives of practical distributed systems. When the sequential specification of T is filte, the conditions may be checked in a finite amount of time to decide the question “Is the consensus number of T at least n?” The conditions are also used to provide a clear proof of the robustness of the consensus hierarchy for read-modify-write and readable objects.
