Multi-μ: an Ada 95 based architecture for fault tolerance support of real-time systems
Proceedings of the 1998 annual ACM SIGAda international conference on Ada
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Implementing a replicated service with group communication
Journal of Systems Architecture: the EUROMICRO Journal
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Fault-Tolerant Cluster-Wise Clock Synchronization for Wireless Sensor Networks
IEEE Transactions on Dependable and Secure Computing
| Hi-index | 0.00 |
This paper surveys two fundamental agreement problems that must be solved in dependable distributed systems. In the consensus problem, processes need to reach a common decision despite failures. In the membership problem, agreement must be reached concerning the history of groups of correct processes that exist over time, as well as on the membership of each group. The exact definitions of these problems and algorithms for solving them depend on the assumptions that are made about process and communication failures. In this paper, we consider the existing literature on consensus and membership protocols designed according to various assumptions and discuss the advantages and drawbacks of the different approaches.