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

DOI10.1016/J.IPL.2009.11.011zbMath1206.68357OpenAlexW2090902720MaRDI QIDQ990136

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

fault-tolerancedistributed algorithmsconcurrencyasynchronous 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)

Related Items (3)

Anonymous asynchronous systems: the case of failure detectors ⋮ The weakest failure detector to implement a register in asynchronous systems with hybrid communication ⋮ What Can be Computed in a Distributed System?

Cites Work

• Unnamed Item
• Asynchronous bounded lifetime failure detectors
• The Weakest Failure Detector for Message Passing Set-Agreement
• Sharing memory robustly in message-passing systems
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Efficient and Robust Sharing of Memory in Message-Passing Systems
• Distributed Computing
• The weakest failure detectors to solve certain fundamental problems in distributed computing

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