On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Muteness Failure Detectors: Specification and Implementation
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Solving Agreement Problems with Weak Ordering Oracles
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
An Efficient Solution to the k-Set Agreement Problem
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Fast Indulgent Consensus with Zero Degradation
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Proceedings of the 13th International Symposium on Distributed Computing
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Proceedings of the 13th International Symposium on Distributed Computing
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
The mobile groups approach for the coordination of mobile agents
Journal of Parallel and Distributed Computing
Eventually consistent failure detectors
Journal of Parallel and 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
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
From Set Membership to Group Membership: A Separation of Concerns
IEEE Transactions on Dependable and Secure Computing
Irreducibility and additivity of set agreement-oriented failure detector classes
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Low complexity Byzantine-resilient consensus
Distributed Computing
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks
IEEE Transactions on Computers
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Journal of Parallel and Distributed Computing
A methodology to design arbitrary failure detectors for distributed protocols
Journal of Systems Architecture: the EUROMICRO Journal
Semi-passive replication and Lazy Consensus
Journal of Parallel and Distributed Computing
On the inherent cost of atomic broadcast and multicast in wide area networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Challenges in evaluating distributed algorithms
Future directions in distributed computing
Future directions in distributed computing
SMS based group communication system for mobile devices
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
The failure detector abstraction
ACM Computing Surveys (CSUR)
Eventually consistent failure detectors
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Rewriting: sleeping to get there faster
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
Distributed group communication system for mobile devices based on SMS
From active data management to event-based systems and more
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Optimistic algorithms for partial database replication
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On the message complexity of indulgent consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.01 |
Consensus is one of the most fundamental problems in the context of fault-tolerant distributed computing. The problem consists, given a set Ω of processes having each an initial value vi, in deciding among Ω on a common value v. In 1985, Fischer, Lynch and Paterson proved that the consensus problem is not solvable in an asynchronous system subject to a single process crash. In 1991, Chandra and Toueg showed that, by augmenting the asynchronous system model with a well defined unreliable failure detector, consensus becomes solvable. They also give an algorithm that solves consensus using the ♦ J failure detector. In this paper we propose a new consensus algorithm, also using the ♦ J failure detector, that is more efficient than the Chandra-Toueg consensus algorithm. We measure efficiency by introducing the notion of latency degree, which defines the minimal number of communication steps needed to solve consensus. The Chandra-Toueg algorithm has a latency degree of 3 (it requires at least three communication steps), whereas our early consensus algorithm requires only two communication steps (latency degree of 2). We believe that this is an interesting result, which adds to our current understanding of the cost of consensus algorithms based on ♦ J.