Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue

Authors:
Bernadette Charron-Bost;Rachid Guerraoui;Andre Schiper
Affiliations:
-;-;-
Venue:
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Year:
2000

Citing 0
Cited 14

The inherent price of indulgence

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
(Im)Possibilities of Predicate Detection in Crash-Affected Systems

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Uniform consensus is harder than consensus

Journal of Algorithms
The inherent price of indulgence

Distributed Computing - Special issue: PODC 02
The perfectly synchronized round-based model of distributed computing

Information and Computation
On termination detection in crash-prone distributed systems with failure detectors

Journal of Parallel and Distributed Computing
Global data computation in chordal rings

Journal of Parallel and Distributed Computing
Relating stabilizing timing assumptions to stabilizing failure detectors regarding solvability and efficiency

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The failure detector abstraction

ACM Computing Surveys (CSUR)
Brief announcement: failure detectors encapsulate fairness

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
The Asynchronous Bounded-Cycle model

Theoretical Computer Science
Exploiting partitioned synchrony to implement accurate failure detectors

International Journal of Critical Computer-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare, in terms of solvability and efficiency, the synchronous model, noted S_S, with the asynchronous model augmented with a perfect failure detector, noted S_P. We first exhibit a problem that, although time-free, is solvable in S_S but not in S_P. We then examine whether one of these two models allows more efficient solutions for designing fault-tolerant applications. In particular, we concentrate on the uniform consensus problem, which is solvable in both models, and we design a uniform consensus algorithm for the S_S model that is more efficient than any algorithm solving uniform consensus in S_P with respect to some significant time complexity measure. From a practical viewpoint, the synchronous model thus seems better than the asynchronous model augmented with a perfect failure detector.