Anonymous asynchronous systems: the case of failure detectors

DOI10.1007/S00446-012-0169-5MaRDI QIDQ360279zbMATHOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(14)

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

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)