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
Book ChapterDOI
What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
TL;DR: In this paper, the authors present a tool support to catch logical errors in distributed algorithms at design time, which are difficult to understand for human engineers to reason about and understand for distributed algorithms.
Proceedings ArticleDOI
Network-Assisted Raft Consensus Algorithm
TL;DR: This poster argues for an affirmative answer by proposing a network-assisted implementation of the Raft consensus algorithm, which reduces consensus latency, is failure-aware, and does not sacrifice correctness or scalability.
Proceedings ArticleDOI
CliqueMap: productionizing an RMA-based distributed caching system
Arjun Singhvi,Aditya Akella,Maggie Anderson,Rob Cauble,Harshad Deshmukh,Dan Gibson,Milo M. K. Martin,Amanda Strominger,Thomas F. Wenisch,Amin Vahdat +9 more
TL;DR: CliqueMap as mentioned in this paper is a hybrid RMA/RPC caching system, which makes use of performant and efficient RMAs on the critical serving path and judiciously applies RPCs toward other functionality.
Book ChapterDOI
Coterie availability in sites
Flavio Junqueira,Keith Marzullo +1 more
TL;DR: This paper introduces two failure models that allow sites to fail, and uses them to derive coteries, which are argued to have better availability than quorums formed by a majority of processes.
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