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

DOI10.1016/J.TCS.2012.06.030zbMATH Open1358.68039OpenAlexW1994382507MaRDI QIDQ392012FDOQ392012

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 crashasynchronous message-passing systematomic registerhybrid communicationnecessity proofshared memory systemweakest failure detector

Mathematics Subject Classification ID

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

Cites Work

• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Tight failure detection bounds on atomic object implementations
• 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
• Sharing memory robustly in message-passing systems
• Efficient and Robust Sharing of Memory in Message-Passing Systems
• Title not available (Why is that?)

Cited In (2)

• What Can be Computed in a Distributed System?
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems

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

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