Every problem has a weakest failure detector

Authors:
Prasad Jayanti;Sam Toueg
Affiliations:
Dartmouth College, Hanover, NH, USA;University of Toronto, Toronto, ON, Canada
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 11
Cited 12

On the minimal synchronism needed for distributed consensus

Journal of the ACM (JACM)
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The weakest failure detectors to solve certain fundamental problems in distributed computing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Mutual exclusion in asynchronous systems with failure detectors

Journal of Parallel and Distributed Computing
The weakest failure detectors to boost obstruction-freedom

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Extracting quorum failure detectors

Proceedings of the 28th ACM symposium on Principles of distributed computing
The weakest failure detector for solving k-set agreement

Proceedings of the 28th ACM symposium on Principles of distributed computing
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On set consensus numbers

DISC'09 Proceedings of the 23rd international conference on Distributed computing
On the existence of weakest failure detectors for mutual exclusion and k-exclusion

DISC'09 Proceedings of the 23rd international conference on Distributed computing
In search of lost time

Information Processing Letters
The failure detector abstraction

ACM Computing Surveys (CSUR)
Anonymous asynchronous systems: the case of failure detectors

DISC'10 Proceedings of the 24th international conference on Distributed computing
Failure detectors encapsulate fairness

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Semantic communication for simple goals is equivalent to on-line learning

ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Wait-freedom with advice

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Asynchronous failure detectors

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several basic problems that arise in fault-tolerant distributed computing were shown to have a weakest failure detector. We show here that every problem that is solvable with a failure detector has a weakest failure detector.