The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit

DOI10.1137/070698877zbMath1261.68064OpenAlexW2063444060MaRDI QIDQ4910568

Vassos Hadzilacos, Sam Toueg, Petr Kuznetsov, 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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

The weakest failure detector for eventual consistency

This page was built for publication: The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit