On the coordinator's rule for Fast Paxos

DOI10.1016/J.IPL.2008.03.001zbMATH Open1186.68047arXiv1710.08047OpenAlexW2053872647MaRDI QIDQ963435FDOQ963435

Authors: Gustavo M. D. Vieira, Luiz E. Buzato 

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value $v$ that is consistent with all past rounds. Rounds are started by a coordinator process and consistency is guaranteed by the rule used by this process for the selection of $v$ and by the properties of process sets called quorums. We show a simplified version of this rule for the specific case where the quorums are defined by the cardinality of these process sets. This rule is of special interest for implementors of the algorithm.

Full work available at URL: https://arxiv.org/abs/1710.08047

Recommendations

• Fast Paxos
• Multicoordinated Paxos
• Revisiting the PAXOS algorithm
• Fast and simple distributed consensus
• scientific article; zbMATH DE number 2088434

zbMATH Keywords

consensusdistributed systemscrash-recoveryPaxos

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14)

Cites Work

• Impossibility of distributed consensus with one faulty process
• Fast Paxos
• Lower bounds for asynchronous consensus

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Multicoordinated Paxos
• Title not available (Why is that?)
• Fast Paxos

This page was built for publication: On the coordinator's rule for Fast Paxos

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963435)