Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Computing on Anonymous Networks: Part II-Decision and Membership Problems
IEEE Transactions on Parallel and Distributed Systems
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
Tight bounds for k-set agreement
Journal of the ACM (JACM)
Distributed Algorithms
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Consensus in Synchronous Systems: A Concise Guided Tour
PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Randomized naming using wait-free shared variables
Distributed Computing
On the importance of having an identity or, is consensus really universal?
Distributed Computing - Special issue: DISC 04
Revisiting simultaneous consensus with crash failures
Journal of Parallel and Distributed Computing
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
SIAM Journal on Computing
Early stopping in Global Data Computation
IEEE Transactions on Parallel and Distributed Systems
Anonymous asynchronous systems: the case of failure detectors
DISC'10 Proceedings of the 24th international conference on Distributed computing
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Hi-index | 0.00 |
This paper addresses the consensus problem in asynchronous systems prone to process crashes, where additionally the processes are anonymous (they cannot be distinguished one from the other: they have no name and execute the same code). To circumvent the three computational adversaries (asynchrony, failures and anonymity) each process is provided with a failure detector of a class denoted ψ, that gives it an upper bound on the number of processes that are currently alive (in a non-anonymous system, the classes ψ and P -the class of perfect failure detectors- are equivalent). The paper first presents a simple ψ-based consensus algorithm where the processes decide in 2t + 1 asynchronous rounds (where t is an upper bound on the number of faulty processes). It then shows one of its main results, namely, 2t + 1 is a lower bound for consensus in the anonymous systems equipped with ψ. The second contribution addresses early-decision. The paper presents and proves correct an early-deciding algorithm where the processes decide in min(2f + 2, 2t + 1) asynchronous rounds (where f is the actual number of process failures). This leads to think that anonymity doubles the cost (wrt synchronous systems) and it is conjectured that min (2f + 2, 2t + 1) is the corresponding lower bound. The paper finally considers the k-set agreement problem in anonymous systems. It first shows that the previous ψ-based consensus algorithm solves the k-set agreement problem in Rt = 2 ⌊t/k⌋ + 1 asynchronous rounds. Then, considering a family of failure detector classes {ψl}0≤lk that generalizes the class ψ(= ψ0), the paper presents an algorithm that solves the k-set agreement in Rt, l = 2⌊ t/k-l⌋ + 1 asynchronous rounds. This last formula relates the cost (Rt, l), the coordination degree of the problem (k), the maximum number of failures (t) and the the strength (l) of the underlying failure detector. Finally the paper concludes by presenting problems that remain open.