The weakest failure detector for solving consensus

616Citations
Citations of this article
122Readers
Mendeley users who have this article in their library.

Abstract

We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [1996] it is shown that ◇script W sign, a failure detector that provides surprisingly little information about which processes have crashed, is sufficient to solve Consensus in asynchronous systems with a majority of correct processes. In this paper, we prove that to solve Consensus, any failure detector has to provide at least as much information as ◇script W sign. Thus, ◇script W sign is indeed the weakest failure detector for solving Consensus in asynchronous systems with a majority of correct processes.

Cite

CITATION STYLE

APA

Chandra, T. D., Hadzilacos, V., & Toueg, S. (1996). The weakest failure detector for solving consensus. Journal of the ACM, 43(4), 685–722. https://doi.org/10.1145/234533.234549

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