The weakest failure detector to implement a register in asynchronous systems with hybrid communication
From MaRDI portal
(Redirected from Publication:392012)
Recommendations
- A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems
- scientific article; zbMATH DE number 2013834
- The weakest failure detectors to solve certain fundamental problems in distributed computing
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
- The weakest failure detector for solving consensus
Cites work
- scientific article; zbMATH DE number 996442 (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
- Asynchronous bounded lifetime failure detectors
- Efficient and Robust Sharing of Memory in Message-Passing Systems
- Sharing memory robustly in message-passing systems
- The weakest failure detector for solving consensus
- Tight failure detection bounds on atomic object implementations
- Unreliable failure detectors for reliable distributed systems
Cited in
(2)
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)