Solving Agreement Problems with Weak Ordering Oracles

Authors:
Fernando Pedone;André Schiper;Péter Urbán;David Cavin
Affiliations:
-;-;-;-
Venue:
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Year:
2002

Citing 16
Cited 6

On the minimal synchronism needed for distributed consensus

Journal of the ACM (JACM)
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
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 Timed Asynchronous Distributed System Model

IEEE Transactions on Parallel and Distributed Systems
Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks

Theoretical Computer Science
Distributed Algorithms

Distributed Algorithms
Solving Agreement Problems with Weak Ordering Oracles

EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Thrifty Generic Broadcast

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Lightweight Solution to Uniform Atomic Broadcast for Asynchronous Systems

FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Consensus: The Big Misunderstanding

FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
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
Neko: A Single Environment to Simulate and Prototype Distributed Algorithms

ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems

A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Early consensus in an asynchronous system with a weak failure detector

Distributed Computing
Randomized byzantine generals

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science

Solving Agreement Problems with Weak Ordering Oracles

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
Wire-speed total order

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Optimistic algorithms for partial database replication

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Optimal and practical WAB-based consensus algorithms

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Multicasting in the presence of aggregated deliveries

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Agreement problems, such as consensus, atomic broadcast, and group membership, are central to the implementation of fault-tolerant distributed systems. Despite the diversity of algorithms that have been proposed for solving agreement problems in the past years, almost all solutions are Crash-Detection Based (CDB). We say that an algorithm is CDB if it uses some information about the status crashed/not crashed of processes. In this paper, we revisit the issue of non-CDB algorithms considering ordering oracles. Ordering oracles have a theoretical interest as well as a practical interest. To illustrate their use, we present solutions to consensus and atomic broadcast, and evaluate the performance of the atomic broadcast algorithm in a cluster of workstations.