Journal ArticleDOI
The part-time parliament
Reads0
Chats0
TLDR
The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.Abstract:
Recent archaeological discoveries on the island of Paxos reveal that the parliament functioned despite the peripatetic propensity of its part-time legislators. The legislators maintained consistent copies of the parliamentary record, despite their frequent forays from the chamber and the forgetfulness of their messengers. The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.read more
Citations
More filters
Journal ArticleDOI
Fault-scalable Byzantine fault-tolerant services
TL;DR: The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine fault-tolerant services that provide better throughput and fault- scalability than replicated state machines using agreement-based protocols.
Journal ArticleDOI
Zyzzyva: speculative Byzantine fault tolerance
TL;DR: In Zyzzyva, replicas reply to a client's request without first running an expensive three-phase commit protocol to agree on the order to process requests, making BFT replication practical for a broad range of demanding services.
Dissertation
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains
TL;DR: Tendermint modernizes classic academic work on the subject to provide a secure consensus protocol with accountability guarantees, as well as an interface for building arbitrary applications above the consensus.
Journal ArticleDOI
A Survey of Distributed Consensus Protocols for Blockchain Networks
TL;DR: A comprehensive review and analysis on the state-of-the-art blockchain consensus protocols is presented in this article, where the authors identify five core components of a blockchain consensus protocol, namely, block proposal, block validation, information propagation, block finalization, and incentive mechanism.
Journal ArticleDOI
Consensus on transaction commit
Jim Gray,Leslie Lamport +1 more
TL;DR: The Paxos Commit algorithm as mentioned in this paper runs a Paxos consensus algorithm on the commit/abort decision of each participant to obtain a transaction commit protocol that uses 2F p 1 coordinators and makes progress if at least F p 1 of them are working properly.
References
More filters
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
Book
Concurrency Control and Recovery in Database Systems
TL;DR: In this article, the design and implementation of concurrency control and recovery mechanisms for transaction management in centralized and distributed database systems is described. But this can lead to interference between queries and updates.
Journal ArticleDOI
Implementing fault-tolerant services using the state machine approach: a tutorial
TL;DR: The state machine approach is a general method for implementing fault-tolerant services in distributed systems and protocols for two different failure models—Byzantine and fail stop are described.
Related Papers (5)
Impossibility of distributed consensus with one faulty process
Unreliable failure detectors for reliable distributed systems
Tushar Deepak Chandra,Sam Toueg +1 more