Necessary and sufficient conditions for broadcast consensus protocols

Authors:
Louise E. Moser;P. M. Melliar-Smith;Vivek Agrawala
Affiliations:
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
Distributed Computing
Year:
1993

Citing 16
Cited 1

Synchronizing clocks in the presence of faults

Journal of the ACM (JACM)
Reaching approximate agreement in the presence of faults

Journal of the ACM (JACM)
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)
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Finite buffers for fast multicast

SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Asynchronous consensus and broadcast protocols

Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Inexact agreement: accuracy, precision, and graceful degradation

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Distributed Fault-Tolerant Real-Time Systems: The Mars Approach

IEEE Micro
Broadcast Protocols for Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Notes on Data Base Operating Systems

Operating Systems, An Advanced Course
On Safety and Timeliness in Distributed Data Management

Concurrency '88 Proceedings of the International Conference on Concurrency
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

Processor Membership in Asynchronous Distributed Systems

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider consensus protocols in asynchronous distributed systems that are based on broadcast communication. We show that a necessary and sufficient condition for the existence of a deterministic consensus protocol is delivery of each broadcast message to at least ⌈(n + k + 1)/2⌉ processes in an n-process system subject to k crash failures with either eventual fair broadcasting or eventual full broadcasting. The broadcast model captures the idea of a broadcast communication medium, such as the Ethernet, in which messages, if delivered, are delivered immediately and in order but not necessarily to all processes.