Fast Genuine Generalized Consensus - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Fast Genuine Generalized Consensus

Pierre Sutra
Marc Shapiro

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.
Fichier principal
Vignette du fichier
FGGC-SRDS-2011.pdf (246.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00932839 , version 1 (17-01-2014)

Identifiers

Cite

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⟩
634 View
460 Download

Altmetric

Share

Gmail Facebook X LinkedIn More