Solving consensus using chandra-toueg’s unreliable failure detectors: A general quorum-based approach

93Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper addresses the Consensus problem in asynchronous distributed systems (made of n processes, at most f of them may crash) equipped with unreliable failure detectors. A generic Consensus protocol is presented: it is quorum-based and works with any failure detector belonging to the class S (provided that f ≤ n – 1) or to the class ◊S (provided that f

Cite

CITATION STYLE

APA

Mostéfaoui, A., & Raynal, M. (1999). Solving consensus using chandra-toueg’s unreliable failure detectors: A general quorum-based approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1693, pp. 49–63). Springer Verlag. https://doi.org/10.1007/3-540-48169-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free