Conditions on input vectors for consensus solvability in asynchronous distributed systems

This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of input vectors for which it is possible to solve consensus despite the occurrence of up to f process crashes. The first main result defines acceptable conditions and shows that these are exactly the conditions for which a consensus protocol exists. Two examples of realistic acceptable conditions are presented, and proved to be maximal, in the sense that they cannot be extended and remain acceptable. The second main result is a generic consensus shared-memory protocol for any acceptable condition. The protocol always guarantees agreement and validity, and terminates (at least) when the inputs satisfy the condition with which the protocol has been instantiated, or when there are no crashes. An efficient version of the protocol is then designed for the message passing model that works when f < n/2, and it is shown...

• Type: Conference
• Year: 2001
• Where: STOC
• Authors: Achour Mostéfaoui, Michel Raynal, Sergio Rajsbaum
• Keywords: Algorithms, Consensus Protocol, Consensus Shared-memory Protocol, Defines Acceptable Conditions, STOC 2001