Anonymous asynchronous systems: the case of failure detectors

DOI10.1007/S00446-012-0169-5zbMATH Open1271.68069OpenAlexW1999591915MaRDI QIDQ360279FDOQ360279

Authors: 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

Recommendations

• Anonymous asynchronous systems: the case of failure detectors
• Anonymity-preserving failure detectors
• The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
• Consensus in anonymous asynchronous systems with crash-recovery and omission failures
• Unreliable failure detectors for reliable distributed systems

zbMATH Keywords

modularityfault-toleranceasynchronous systemdistributed computabilityanonymous systemcommunication abstractionfailure detectormessage-passing systemprocess crash

Mathematics Subject Classification ID

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

Cites Work

• Computation in networks of passively mobile finite-state sensors
• Title not available (Why is that?)
• Computing on an anonymous ring
• 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?)
• 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
• Title not available (Why is that?)
• The weakest failure detectors to solve certain fundamental problems in distributed computing
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems

Cited In (14)

• Anonymous and fault-tolerant shared-memory computing
• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
• Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
• Consensus in anonymous asynchronous systems with crash-recovery and omission failures
• Leader-based de-anonymization of an anonymous read/write memory
• The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
• Anonymity-preserving failure detectors
• Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
• Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
• Anonymous asynchronous systems: the case of failure detectors
• Mutual exclusion in fully anonymous shared memory systems
• Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
• Asynchronous failure detectors
• Relationships between broadcast and shared memory in reliable anonymous distributed systems

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

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