Anonymous asynchronous systems: the case of failure detectors

DOI10.1007/S00446-012-0169-5zbMath1271.68069OpenAlexW1999591915MaRDI QIDQ360279

François Bonnet, Michel Raynal

Publication date: 26 August 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-012-0169-5

zbMATH Keywords

fault-tolerancemodularityasynchronous systemdistributed computabilityanonymous systemcommunication abstractionfailure detectormessage-passing systemprocess crash

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

Leader-based de-anonymization of an anonymous read/write memory ⋮ Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures ⋮ Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers ⋮ Consensus in anonymous asynchronous systems with crash-recovery and omission failures ⋮ Mutual exclusion in fully anonymous shared memory systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems
• Computation in networks of passively mobile finite-state sensors
• On the computability power and the robustness of set agreement-oriented failure detector classes
• Every problem has a weakest failure detector
• The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
• The Weakest Failure Detector for Message Passing Set-Agreement
• Tight failure detection bounds on atomic object implementations
• Anonymous Asynchronous Systems: The Case of Failure Detectors
• The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
• Impossibility of distributed consensus with one faulty process
• Computing on an anonymous ring
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• The weakest failure detectors to solve certain fundamental problems in distributed computing

This page was built for publication: Anonymous asynchronous systems: the case of failure detectors