Abstract
Failure detectors in asynchronous environments is studied using a novel generic formulation of failure detection properties which generalizes several previous works. An asynchronous environment that admits message omission failures is studied. Chandra and Toueg's definitions of failure detection Completeness and Accuracy to the omission failure model is adapted, and define an eventual weak failure detector that allows many majority of the process that become connected to reach a Consensus decision despite any number of transient communication failures in their past.
Original language | English |
---|---|
Pages | 286 |
Number of pages | 1 |
DOIs | |
State | Published - 1997 |
Event | Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA Duration: 21 Aug 1997 → 24 Aug 1997 |
Conference
Conference | Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing |
---|---|
City | Santa Barbara, CA, USA |
Period | 21/08/97 → 24/08/97 |