Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The topological structure of asynchronous computability
Journal of the ACM (JACM)
k-set agreement with limited accuracy failure detectors
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
Tight bounds for k-set agreement
Journal of the ACM (JACM)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Distributed Algorithms
Consensus in Synchronous Systems: A Concise Guided Tour
PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Uniform consensus is harder than consensus
Journal of Algorithms
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Brief announcement: pareto optimal solutions to consensus and set consensus
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
The k-set agreement problem is a generalization of the consensus problem: each process proposes a value, and each non-faulty process has to decide a value such that a decided value is a proposed value, and no more than k different values are decided. This paper presents a surprisingly simple protocol that solves the k-set agreement problem in synchronous systems prone to up to tn processes can crash (where n is the total number of processes). The proposed protocol is the first early stopping k-set agreement protocol that does not impose a constraint on t. It allows the processes to decide and stop by min $(\lfloor f/k \rfloor +2,\lfloor t/k \rfloor+1)$ rounds where f is the number of actual crashes (0≤ f ≤ t). In addition to its conceptual simplicity, the protocol has an additional noteworthy feature, namely, it is particularly efficient in common case scenarios. This comes from the fact that it is based on a mechanism that allows the processes to take into account the actual pattern of failures and not only their number, thereby allowing the processes to decide in much less than ${\lfloor f/k \rfloor +2}$ coding from an InlineMediaObject here! rounds in a lot of cases.