With Finite Memory Consensus Is Easier Than Reliable Broadcast

Authors:
Carole Delporte-Gallet;Stéphane Devismes;Hugues Fauconnier;Franck Petit;Sam Toueg
Affiliations:
LIAFA, Université D. Diderot, Paris, France;VERIMAG, Université Joseph Fourier, Grenoble, France;LIAFA, Université D. Diderot, Paris, France;INRIA/LIP Laboratory, Univ. of Lyon/ENS Lyon, Lyon, France;Department of Computer Science, University of Toronto, Toronto, Canada
Venue:
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Year:
2008

Citing 22
Cited 0

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)
Data link layer: two impossibility results

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
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)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Generic Consensus Service

IEEE Transactions on Software Engineering
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Simulating Crash Failures with Many Faulty Processors (Extended Abstract)

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Revising the Weakest Failure Detector for Uniform Reliable Broadcast

Proceedings of the 13th International Symposium on Distributed Computing
A Realistic Look At Failure Detectors

DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems

A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
The weakest failure detectors to solve certain fundamental problems in distributed computing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Disk Paxos

Distributed Computing
Mutual exclusion in asynchronous systems with failure detectors

Journal of Parallel and Distributed Computing
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony

DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks

DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
A Simple and Efficient Randomized Byzantine Agreement Algorithm

IEEE Transactions on Software Engineering
In search of the holy grail: looking for the weakest failure detector for wait-free set agreement

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
The weakest failure detectors to boost obstruction-freedom

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus , repeated consensus and reliable broadcast . With finite process memory, we show that in some sense consensus is easier to solve than reliable broadcast, and that reliable broadcast is as difficult to solve as repeated consensus: More precisely, with finite memory, consensus can be solved with failure detector $\cal S$, and ${\cal P}^-$ (a variant of the perfect failure detector which is stronger than $\cal S$) is necessary and sufficient to solve reliable broadcast and repeated consensus.