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 |
|---|---|
| Title of host publication | PODC 1997 |
| Subtitle of host publication | Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing |
| Publisher | ACM |
| Pages | 286 |
| Number of pages | 1 |
| ISBN (Print) | 9780897919524 |
| DOIs | |
| State | Published - 1 Aug 1997 |
| Event | 16th Annual ACM Symposium on Principles of Distributed Computing, PODC 1997 - Santa Barbara, CA, USA Duration: 21 Aug 1997 → 24 Aug 1997 |
Conference
| Conference | 16th Annual ACM Symposium on Principles of Distributed Computing, PODC 1997 |
|---|---|
| City | Santa Barbara, CA, USA |
| Period | 21/08/97 → 24/08/97 |
Fingerprint
Dive into the research topics of 'Failure detectors in omission failure environments'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver