Worldwide consensus

Authors:
Francisco Maia;Miguel Matos;José Pereira;Rui Oliveira
Affiliations:
High-Assurance Software Laboratory, University of Minho, Braga, Portugal;High-Assurance Software Laboratory, University of Minho, Braga, Portugal;High-Assurance Software Laboratory, University of Minho, Braga, Portugal;High-Assurance Software Laboratory, University of Minho, Braga, Portugal
Venue:
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Year:
2011

Citing 9
Cited 0

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)
On Quiescent Reliable Communication

SIAM Journal on Computing
The Mutable Consensus Protocol

SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Early consensus in an asynchronous system with a weak failure detector

Distributed Computing
Operating system support for planetary-scale network services

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Paxos made live: an engineering perspective

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Epidemic Information Dissemination in Distributed Systems

Computer
SPLAY: distributed systems evaluation made simple (or how to turn ideas into live systems in a breeze)

NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consensus is an abstraction of a variety of important challenges in dependable distributed systems. Thus a large body of theoretical knowledge is focused on modeling and solving consensus within different system assumptions. However, moving from theory to practice imposes compromises and design decisions that may impact the elegance, trade-offs and correctness of theoretical appealing consensus protocols. In this paper we present the implementation and detailed analysis, in a real environment with a large number of nodes, of mutable consensus, a theoretical appealing protocol able to offer a wide range of trade-offs (called mutations) between decision latency and message complexity. The analysis sheds light on the fundamental behavior of the mutations, and leads to the identification of problems related to the real environment. Such problems are addressed without ever affecting the correctness of the theoretical proposal.