A timing assumption and two t-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
DOI10.1007/S00453-008-9190-2zbMATH Open1187.68080OpenAlexW2001743172MaRDI QIDQ848847FDOQ848847
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
Recommendations
fault-toleranceasynchronous systemshared memoryprocess crashatomic registeromega\(t\)-resilient protocoleventual leadersystem modeltimer propertytiming assumptions
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Randomized wait-free concurrent objects (extended abstract)
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- Title not available (Why is that?)
- On implementing omega in systems with weak reliability and synchrony assumptions
- Distributed Computing
- Communication-efficient leader election and consensus with limited link synchrony
Cited In (5)
This page was built for publication: A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848847)
