A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
From MaRDI portal
Publication:848847
DOI10.1007/s00453-008-9190-2zbMath1187.68080MaRDI QIDQ848847
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9190-2
fault-tolerance; shared memory; asynchronous system; process crash; atomic register; omega; \(t\)-resilient protocol; eventual leader; system model; timer property; timing assumptions
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Cites Work
- Unnamed Item
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- On implementing omega in systems with weak reliability and synchrony assumptions
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Randomized wait-free concurrent objects (extended abstract)
- Distributed Computing
- Communication-efficient leader election and consensus with limited link synchrony