Skip to Main content Skip to Navigation
Conference papers

Fast Genuine Generalized Consensus

Pierre Sutra 1, 2 Marc Shapiro 1, 2
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : Consensus (agreeing on a sequence of commands) is central to the operation and performance of distributed systems. A well-known solution to consensus is Fast Paxos. In a recent paper, Lamport enhances Fast Paxos by leveraging the commutativity of concurrent commands. The new primitive, called Generalized Paxos, reduces the collision rate, and thus the latency of Fast Paxos. However if a collision occurs, Generalized Paxos needs four communication steps to recover, which is slower than Fast Paxos. This paper presents FGGC, a novel consensus algorithm that reduces recovery delay when a collision occurs to one. FGGC tolerates f < n/2 replicas crashes, and during failure-free runs, processes learn commands in two steps if all commands commute, and three steps otherwise; this is optimal. Moreover, as long as no fault occurs, FGGC needs only f + 1 replicas to progress.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Marc Shapiro <>
Submitted on : Friday, January 17, 2014 - 5:52:20 PM
Last modification on : Wednesday, June 12, 2019 - 1:34:48 AM
Long-term archiving on: : Friday, April 18, 2014 - 11:53:19 AM


Files produced by the author(s)



Pierre Sutra, Marc Shapiro. Fast Genuine Generalized Consensus. SRDS 2011 - 30th IEEE Symposium on Reliable Distributed Systems, Oct 2011, Madrid, Spain. pp.255--264, ⟨10.1109/SRDS.2011.38⟩. ⟨hal-00932839⟩



Record views


Files downloads