Sciweavers

Share
PODC
2015
ACM

The Weakest Failure Detector for Eventual Consistency

3 years 3 months ago
The Weakest Failure Detector for Eventual Consistency
In its classical form, a consistent replicated service requires all replicas to witness the same evolution of the service state. Assuming a message-passing environment with a majority of correct processes, the necessary and sufficient information about failures for implementing a general state machine replication scheme ensuring consistency is captured by the Ω failure detector. This paper shows that in such a message-passing environment, Ω is also the weakest failure detector to implement an eventually consistent replicated service, where replicas are expected to agree on the evolution of the service state only after some (a priori unknown) time. In fact, we show that Ω is the weakest to implement eventual consistency in any message-passing environment, i.e., under any assumption on when and where failures might occur. Ensuring (strong) consistency in any environment requires, in addition to Ω, the quorum failure detector Σ. Our paper thus captures, for the first time, an e...
Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Fra
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where PODC
Authors Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens
Comments (0)
books