Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
A combinatorial characterization of the distributed 1-solvable tasks
Journal of Algorithms
Atomic snapshots of shared memory
Journal of the ACM (JACM)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility results in the presence of multiple faulty processes
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Possibility and impossibility results in a shared memory environment
Acta Informatica
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Atomic Snapshots in O (n log n) Operations
SIAM Journal on Computing
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
SIAM Journal on Computing
Three-Processor Tasks Are Undecidable
SIAM Journal on Computing
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
The BG distributed simulation algorithm
Distributed Computing
Distributed Algorithms
Linear-Time Snapshot Protocols for Unbalanced Systems
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Linear-Time Snapshot Using Multi-writer Multi-reader Registers
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Deciding 1-sovability of distributed task is NP-hard
WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
The Best of Both Worlds: A Hybrid Approach to Solve Consensus
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Atomic snapshots using lattice agreement
Distributed Computing
Brief announcement: the synchronous condition-based consensus hierarchy
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Information Processing Letters
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
Middleware support for the deployment of ubiquitous software components
Personal and Ubiquitous Computing - Special Issue: Selected Papers of the ARCS06 Conference
Constraint-Based deployment of distributed components in a dynamic network
ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
One-step consensus solvability
DISC'06 Proceedings of the 20th international conference on Distributed Computing
An improved algorithm for adaptive condition-based consensus
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Propagative deployment of hierarchical components in a dynamic network
CD'05 Proceedings of the Third international working conference on Component Deployment
Hi-index | 0.00 |
The condition-based approach for consensus solvability consists of identifying sets of input vectors, called conditions, for which there exists an asynchronous protocol solving consensus despite the occurrence of up to f process crashes.This paper investigates Cf, the largest set of conditions which allow us to solve the consensus problem in an asynchronous shared memory system.The first part of the paper shows that Cf is made up of a hierarchy of classes of conditions, Cf[d]. where d is a parameter (called degree of the condition), starting with d=min(n - f, f) and ending with d = 0, where Cf0=Cf. We prove that each one is strictly contained in the previous one: Cf[d] ⊂ Cf[d-1]. Various properties of the hierarchy are also derived. It is shown that a class can be characterized in two equivalent but complementary ways: one is convenient for designing protocols while the other is for analyzing the class properties. The paper also defines a linear family of conditions that can be used to derive many specific conditions. In particular, for each d, two natural conditions are presented.The second part of the paper is devoted to the design of efficient condition-based protocols. A generic condition-based protocol is presented. This protocol can be instantiated with any condition C, C ∈ Cf[d], and requires at most (2n+1) ⌈log2(⌈(f - d)/2⌉+1)⌉ shared memory read/write operations per process in the synchronization part of the protocol. Thus, the value (f - d) represents the "difficulty" of the class Cf[d]. An improvement of the protocol for the conditions in Cf[0] is also presented.