The weakest failure detector to implement a register in asynchronous systems with hybrid communication

DOI10.1016/j.tcs.2012.06.030zbMath1358.68039OpenAlexW1994382507MaRDI QIDQ392012

Damien Imbs, Michel Raynal

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.030

zbMATH Keywords

fault-tolerancedistributed algorithmfailure detectorprocess crashshared memory systemasynchronous message-passing systematomic registerhybrid communicationnecessity proofweakest failure detector

Mathematics Subject Classification ID

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

Related Items (1)

What Can be Computed in a Distributed System?

Cites Work

• Unnamed Item
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems
• Asynchronous bounded lifetime failure detectors
• Tight failure detection bounds on atomic object implementations
• 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

This page was built for publication: The weakest failure detector to implement a register in asynchronous systems with hybrid communication