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
Proceedings ArticleDOI
ETTM: a scalable fault tolerant network manager
Colin Dixon,Hardeep Uppal,Vjekoslav Brajkovic,Dane Brandon,Thomas Anderson,Arvind Krishnamurthy +5 more
TL;DR: This paper designs, implements, and evaluates a new scalable and fault tolerant network manager, called ETTM, for securely and efficiently managing network resources at a packet granularity, and shows that functionality that seemingly must be implemented inside the network can be simply and efficiently implemented in this system.
Journal ArticleDOI
The weakest failure detectors to boost obstruction-freedom
TL;DR: It is shown that wait-free contention managers, unlike their non-blocking counterparts, impose an inherent non-trivial overhead even in contention-free executions.
New Results - PSYNC: A partially synchronous language for fault-tolerant distributed algorithms
TL;DR: The high-level lockstep abstraction introduced by PSync simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification.
Book ChapterDOI
Revisiting the Paxos Algorithm
TL;DR: The Clock GTA provides a systematic way of describing timing-based systems in which there is a notion of “ normal” timing behavior, but that do not necessarily always exhibit this “normal” behavior.
Proceedings ArticleDOI
Using n-trees for scalable event ordering in peer-to-peer games
TL;DR: It is shown the asymptotic analysis of N-Trees indicates that they will perform well for scalable peer-to-peer event ordering, and is provided in comparison to other distributed architectures for peer- to-peer games.
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