The weakest failure detectors to solve certain fundamental problems in distributed computing

DOI10.1145/1011767.1011818MaRDI QIDQ5501514zbMATH OpenOpenAlexFDO

Authors Carole Delporte-Gallet, Hugues Fauconnier, Vassos Hadzilacos, Petr Kuznetsov, Sam Toueg, Rachid Guerraoui

Publication date 3 August 2015

Published in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/83471/files/1596162953p115-delporte.pdf

zbMATH Keywords

consensusnon-blocking atomic commitquittable consensusregisterweakest failure detector

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• The weakest failure detectors to solve quittable consensus and nonblocking atomic commit
• The weakest failure detector for solving consensus
• The weakest failure detector to solve nonuniform consensus
• The weakest failure detector to solve nonuniform consensus
• On the weakest failure detector ever

Cited in

(28)

• Asynchronous bounded lifetime failure detectors
• On the hardness of failure-sensitive agreement problems.
• Practically-self-stabilizing virtual synchrony
• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
• Failure detectors encapsulate fairness
• The weakest failure detector to solve nonuniform consensus
• Consensus in rooted dynamic networks with short-lived stability
• On implementing omega in systems with weak reliability and synchrony assumptions
• On the weakest failure detector ever
• Every problem has a weakest failure detector
• Anonymous asynchronous systems: the case of failure detectors
• On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion
• The weakest failure detector to implement a register in asynchronous systems with hybrid communication
• The weakest failure detector for solving consensus
• scientific article; zbMATH DE number 2013834 (Why is no real title available?)
• The weakest failure detectors to solve quittable consensus and nonblocking atomic commit
• The weakest failure detector to solve nonuniform consensus
• On the weakest failure detector ever
• On the road to the weakest failure detector for k-set agreement in message-passing systems
• Wait-freedom with advice
• The missing piece: a distributed system-level diagnosis model for the implementation of unreliable failure detectors
• The minimum information about failures for solving non-local tasks in message-passing systems
• Satrapy: from abstract to practical consensus for heterogeneous quorum systems
• Managed agreement: generalizing two fundamental distributed agreement problems
• Initial failures in distributed computations
• An impossibility about failure detectors in the iterated immediate snapshot model
• Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
• 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 certain fundamental problems in distributed computing

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