Failure detectors encapsulate fairness
From MaRDI portal
Publication:1938374
DOI10.1007/s00446-012-0164-xzbMath1284.68074OpenAlexW2053240220MaRDI QIDQ1938374
Scott M. Pike, Srikanth Sastry, Jennifer Lundelius Welch
Publication date: 4 February 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/104892
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Unnamed Item
- The weakest failure detectors to boost obstruction-freedom
- On the computability power and the robustness of set agreement-oriented failure detector classes
- On implementing omega in systems with weak reliability and synchrony assumptions
- Mutual exclusion in asynchronous systems with failure detectors
- The message classification model
- Structured derivations of consensus algorithms for failure detectors
- Every problem has a weakest failure detector
- The Iterated Restricted Immediate Snapshot Model
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- On Quiescent Reliable Communication
- An introduction to oracles for asynchronous distributed systems
- The weakest failure detector for solving k-set agreement
- Distributed Computing
- Failure detectors are schedulers
- Wait-Free Dining Under Eventual Weak Exclusion
- Communication-efficient leader election and consensus with limited link synchrony
- The weakest failure detectors to solve certain fundamental problems in distributed computing
This page was built for publication: Failure detectors encapsulate fairness
