A simple proof of the necessity of the failure detector to implement an atomic register in asynchronous message-passing systems

DOI10.1016/J.IPL.2009.11.011MaRDI QIDQ990136zbMATHOpenAlexFDO

Authors François Bonnet, Michel Raynal

Publication date 2 September 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.11.011

zbMATH Keywords

distributed algorithmsfault-toleranceconcurrencyasynchronous message-passing systematomic registerweakest failure detectortheoty of computation

Mathematics Subject Classification ID

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

Recommendations

• The weakest failure detector to implement a register in asynchronous systems with hybrid communication
• Non-blocking atomic commit in asynchronous distributed systems with failure detectors
• Mutual exclusion in asynchronous systems with failure detectors
• scientific article; zbMATH DE number 2013834
• Tight failure detection bounds on atomic object implementations
• The weakest failure detectors to solve quittable consensus and nonblocking atomic commit

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Asynchronous bounded lifetime failure detectors
• Distributed Computing
• Efficient and Robust Sharing of Memory in Message-Passing Systems
• Sharing memory robustly in message-passing systems
• 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
• Unreliable failure detectors for reliable distributed systems

Cited in

(4)

• Two-bit messages are sufficient to implement atomic read/write registers in crash-prone systems
• The weakest failure detector to implement a register in asynchronous systems with hybrid communication
• Anonymous asynchronous systems: the case of failure detectors
• What can be computed in a distributed system?

This page was built for publication: A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems

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