The weakest failure detectors to solve quittable consensus and nonblocking atomic commit

DOI10.1137/070698877MaRDI QIDQ4910568zbMATHOpenAlexFDO

Authors Vassos Hadzilacos, Petr Kuznetsov, Sam Toueg, Rachid Guerraoui

Publication date 19 March 2013

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/185273

zbMATH Keywords

consensusfault-tolerant algorithmsfailure detectionatomic commit problemasynchronous distributed computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The weakest failure detectors to solve certain fundamental problems in distributed computing
• On the hardness of failure-sensitive agreement problems.
• The weakest failure detector to solve nonuniform consensus
• The weakest failure detector to solve nonuniform consensus
• The weakest failure detector for solving consensus

Cited in

(9)

• The weakest failure detector to solve nonuniform consensus
• The weakest failure detector to solve nonuniform consensus
• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• A note on atomicity: boosting Test\&Set to solve consensus
• The weakest failure detectors to solve certain fundamental problems in distributed computing
• Revisiting the relationship between non-blocking atomic commitment and consensus
• On the hardness of failure-sensitive agreement problems.
• The weakest failure detector for eventual consistency
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems

This page was built for publication: The weakest failure detectors to solve quittable consensus and nonblocking atomic commit

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