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
CATS: Linearizability and Partition Tolerance in Scalable and Self-Organizing Key-Value Stores
TL;DR: This paper presents the design and implementation of CATS, a distributed key-value store which uses consistent quorums to guarantee linearizability and partition tolerance in such adverse and dynamic network conditions and shows that consistency can be achieved with practical performance and modest throughput overhead for read-intensive workloads.
Proceedings ArticleDOI
Brief Announcement: Practical Synchronous Byzantine Consensus
TL;DR: This paper improves the Byzantine fault tolerance to n = 2f + 1 by utilizing the synchrony assumption and solves synchronous authenticated Byzantine agreement in fewer expected rounds than the best existing solution.
Proceedings ArticleDOI
A generic framework for indulgent consensus
R. Guerraoui,M. Raynal +1 more
TL;DR: This generic framework provides indulgent consensus protocols that are particularly simple and efficient both in well-behaved runs and in stable runs, and in those runs, the protocols terminate in two communication steps (which is optimal).
Proceedings ArticleDOI
AllConcur: Leaderless Concurrent Atomic Broadcast
TL;DR: AllConcur as discussed by the authors is a distributed system that provides agreement through a leaderless concurrent atomic broadcast algorithm, thus, not suffering from the bottleneck of a central coordinator, all components exchange messages concurrently through a logical overlay network that employs early termination to minimize the agreement latency.
Proceedings ArticleDOI
Prophecy: using history for high-throughput fault tolerance
TL;DR: This work eliminates the cost for read-mostly workloads through Prophecy, a system that interposes itself between clients and any replicated service, and derives a distributed variant of Prophecy that achieves the same consistency but without any trusted components.
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