Threshold protocols in survivor set systems

DOI10.1007/S00446-010-0107-3zbMath1231.68058OpenAlexW2058924845MaRDI QIDQ661005

Lucia Draque Penso, Keith Marzullo, Flavio P. Junqueira, Maurice P. Herlihy

Publication date: 6 February 2012

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-010-0107-3

zbMATH Keywords

threshold modelmodel equivalencevoterscore/survivor set modelindependent and identically distributed (IID) failuresreplication protocolsthreshold protocols

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The topological structure of asynchronous computability
• Simplifying fault-tolerance
• Automatically increasing the fault-tolerance of distributed algorithms
• How to assign votes in a distributed system
• The Byzantine Generals Problem
• Unreliable failure detectors for reliable distributed systems
• Randomized wait-free concurrent objects (extended abstract)
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• Refined quorum systems

This page was built for publication: Threshold protocols in survivor set systems