Solving Agreement Problems with Weak Ordering Oracles
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
A General Framework to Solve Agreement Problems
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Throughput optimal total order broadcast for cluster environments
ACM Transactions on Computer Systems (TOCS)
| Hi-index | 0.00 |
Chandra and Toueg proposed in 1993 a new approach to overcome the impossibility of reaching deterministically Consensus --- and by corollary Atomic Broadcast --- in asynchronous systems subject to crash failures. They augment the asynchronous system with a possibly Unreliable Failure Detector which provides some information about the operational state of processes. In this paper, we present an extension of the Consensus problem that we call Uniform Prefix Agreement. This extension enables all the processes to propose a flow of messages during an execution --- instead of one as in the Consensus problem --- and uses all these proposed messages to compose its decision value. Uniform Prefix Agreement is based on an Unreliable Failure Detectors. We use repeated executions of Uniform Prefix Agreement to build an efficient and lightweight Uniform Atomic Broadcast algorithm. This paper describes the Uniform Prefix Agreement and Uniform Atomic Broadcast algorithms.