A weakest failure detector-based asynchronous consensus protocol for f

DOI10.1016/J.IPL.2004.01.001zbMATH Open1178.68075OpenAlexW1970475305MaRDI QIDQ2390214FDOQ2390214

Roy Friedman, Michel Raynal, Achour Mostefaoui

Publication date: 21 July 2009

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.01.001

Recommendations

• The weakest failure detector for solving consensus
• A simple and fast asynchronous consensus protocol based on a weak failure detector
• The weakest failure detector for solving consensus
• Early consensus in an asynchronous system with a weak failure detector
• scientific article; zbMATH DE number 2013834

zbMATH Keywords

consensusdistributed algorithmsfault toleranceprocess crashunreliable failure detectorauthorasynchronous distributed system

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• Unreliable failure detectors for reliable distributed systems
• Impossibility of distributed consensus with one faulty process
• The weakest failure detector for solving consensus
• Title not available (Why is that?)

Cited In (8)

• Open consensus
• The weakest failure detector for solving consensus
• On implementing omega with weak reliability and synchrony assumptions
• The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
• Title not available (Why is that?)
• The weakest failure detector to solve nonuniform consensus
• The weakest failure detector to solve nonuniform consensus
• From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors

This page was built for publication: A weakest failure detector-based asynchronous consensus protocol for \(f<n\)

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