Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Using process groups to implement failure detection in asynchronous environments
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
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)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Transaction Model vs. Virtual Synchrony Model: Bridging the Gap
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
Paradigms for Distributed Programs
Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985 Munich
Consensus in Asynchronous Systems Where Processes Can Crash and Recover
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Reducing the cost for non-blocking in atomic commitment
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Total Order Multicast to Multiple Groups
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Election Vs. Consensus in Asynchronous Systems
Election Vs. Consensus in Asynchronous Systems
On the Impossibility of Group Membership
On the Impossibility of Group Membership
Newtop: a fault-tolerant group communication protocol
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
View Synchronous Communication in Large Scale Networks
View Synchronous Communication in Large Scale Networks
Group Membership and View Synchrony in Partitionable Asynchronous Distributed Systems: Specifications
Failure detection and consensus in the crash-recovery model
Distributed Computing
Encapsulating Failure Detection: From Crash to Byzantine Failures
Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
Three-tier replication for FT-CORBA infrastructures
Software—Practice & Experience
IEEE Transactions on Knowledge and Data Engineering
From Set Membership to Group Membership: A Separation of Concerns
IEEE Transactions on Dependable and Secure Computing
Fully Distributed Three-Tier Active Software Replication
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Programming Model for Fault-Tolerant Distributed Computing
IEEE Transactions on Dependable and Secure 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
Using Bounded Model Checking to Verify Consensus Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Services for fault-tolerant conflict resolution in air traffic management
Proceedings of the 2008 RISE/EFTS Joint International Workshop on Software Engineering for Resilient Systems
With Finite Memory Consensus Is Easier Than Reliable Broadcast
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Design and performance of a generic consensus component for critical distributed applications
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Asynchronous Byzantine consensus with 2f+1 processes
Proceedings of the 2010 ACM Symposium on Applied Computing
Communication and data sharing for dynamic distributed systems
Future directions in distributed computing
Dissecting distributed computations
Future directions in distributed computing
OPEN EDEN: a portable fault tolerant CORBA architecture
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Rewriting: sleeping to get there faster
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
Generating fast atomic commit from hyperfast consensus
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Journal of Network and Computer Applications
Hi-index | 0.01 |
This paper describes a modular approach for the construction of fault-tolerant agreement protocols. The approach is based on a generic consensus service. Fault-tolerant agreement protocols are built using a client-server interaction, where the clients are the processes that must solve the agreement problem and the servers implement the consensus service. This service is accessed through a generic consensus filter, customized for each specific agreement problem. We illustrate our approach on the construction of various fault-tolerant agreement protocols, such as nonblocking atomic commitment, group membership, view synchronous communication, and total order multicast. Through a systematic reduction to consensus, we provide a simple way to solve agreement problems. In addition to its modularity, our approach enables efficient implementations of agreement protocols and precise characterization of the assumptions underlying their liveness and safety properties.