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)
Agreement is harder than consensus: set consensus problems in totally asynchronous systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors
IEEE Transactions on Computers
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
Early consensus in an asynchronous system with a weak failure detector
Distributed Computing
Hi-index | 0.00 |
In this paper, we present a ⋄Sx-based solution to solve the k- Set agreement problem for f n+k-1/2 where f is the maximum number of crashes that can occur and n is the total number of processes. Just as the k-Set agreement problem is a generalization of the consensus problem (at most k different values can be decided), the class of ⋄Sx failure detectors is a generalization of ⋄S failure detectors, where x, the sco pe of the accuracy property, is the number of processes that do not have to suspect a correct process. We propose a simple protocol based on the following idea: k - 1 "privileged" processes directly decide their initial value, while the others (n - k + 1 processes) run a 1-Set agreement protocol (i.e., a consensus protocol) to decide on one value. This simple idea enables tot olerate up to (n + k - 1)/2 crash failures, and may lead the k-set agreement problem to be solved in only one broadcast. The protocol is decomposed into three modules. Each process executes either 1, 2 or 3 modules. To reduce the scope of accuracy, more processes have toe xecute the three modules. But, in that case, more messages have to be exchanged. Finally, the proposed solution considers the degree of repetition of the proposed values and takes advantage of a possible high degree of redundancy of one of them.