Unreliable failure detectors for asynchronous systems (preliminary version)
From MaRDI portal
Publication:5255830
DOI10.1145/112600.112627zbMath1314.68022OpenAlexW2024645712MaRDI QIDQ5255830
Sam Toueg, Tushar Deepak Chandra
Publication date: 19 June 2015
Published in: Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/112600.112627
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (7)
On real-time and non real-time distributed computing ⋮ The inherent cost of strong-partial view-synchronous communication ⋮ Revisiting the relationship between non-blocking atomic commitment and consensus ⋮ The Failure Discovery problem ⋮ Total ordering algorithms for asynchronous Byzantine systems ⋮ Generating fast indulgent algorithms ⋮ Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors
This page was built for publication: Unreliable failure detectors for asynchronous systems (preliminary version)
