A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems

DOI10.1007/S00453-008-9190-2zbMath1187.68080OpenAlexW2001743172MaRDI QIDQ848847

N. E. Zubov

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

zbMATH Keywords

fault-toleranceshared memoryasynchronous systemprocess crashatomic registeromega\(t\)-resilient protocoleventual leadersystem modeltimer propertytiming assumptions

Mathematics Subject Classification ID

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

Related Items (1)

What Can be Computed in a Distributed System?

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

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