The weakest failure detector for solving consensus
From MaRDI portal
Publication:5348846
DOI10.1145/135419.135451zbMath1369.68045OpenAlexW2158987725MaRDI QIDQ5348846
Sam Toueg, Vassos Hadzilacos, Tushar Deepak Chandra
Publication date: 21 August 2017
Published in: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6208
Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)
Related Items (6)
On real-time and non real-time distributed computing ⋮ Revisiting the relationship between non-blocking atomic commitment and consensus ⋮ Dissecting distributed coordination ⋮ Total ordering algorithms for asynchronous Byzantine systems ⋮ When consensus meets self-stabilization ⋮ Increasing the resilience of distributed and replicated database systems
This page was built for publication: The weakest failure detector for solving consensus
