On the weakest failure detector ever

DOI10.1145/1281100.1281135zbMath1283.68096OpenAlexW2110210685MaRDI QIDQ5401416

Calvin Newport, Petr Kuznetsov, Rachid Guerraoui, Maurice P. Herlihy, Nancy A. Lynch

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.3160

zbMATH Keywords

failure detectorswait-free impossibilitiesset-agreementweakest failure detector ever

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

On the weakest failure detector ever ⋮ Failure detectors as type boosters ⋮ The Weakest Failure Detector for Message Passing Set-Agreement

This page was built for publication: On the weakest failure detector ever