scispace - formally typeset
Journal ArticleDOI

The part-time parliament

Leslie Lamport
- 01 May 1998 - 
- Vol. 16, Iss: 2, pp 133-169
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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

FAWN: a fast array of wimpy nodes

TL;DR: The design centers around purely log-structured datastores that provide the basis for high performance on flash storage, as well as for replication and consistency obtained using chain replication on a consistent hashing ring.
Journal ArticleDOI

Guaranteeing Deadlines for Inter-Data Center Transfers

TL;DR: The simulations and test bed experiments show that Amoeba, by harnessing DNA’s malleability, accommodates 15% more user requests with deadlines, while achieving 60% higher WAN utilization than prior solutions.
Proceedings ArticleDOI

Chapar: certified causally consistent distributed key-value stores

TL;DR: A framework called Chapar is presented for modular verification of causal consistency for replicated key-value store implementations and their client programs and a simple automatic model checker for the correctness of client programs is implemented.
Journal ArticleDOI

Dynamic atomic storage without consensus

TL;DR: This article discovers that, perhaps surprisingly, dynamic R/W storage is solvable in a completely asynchronous system: it presents DynaStore, an algorithm that solves this problem.
Proceedings Article

I can't believe it's not causal! scalable causal consistency with no slowdown cascades

TL;DR: Observable Causal Consistency Using Lossy Timestamps is described, the first scalable, geo-replicated data store that provides causal consistency to its clients without exposing the system to the possibility of slowdown cascades, a key obstacle to the deployment of causal consistency at scale.
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)