scispace - formally typeset
Journal ArticleDOI

The part-time parliament

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

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

Dispel: Byzantine SMR with Distributed Pipelining.

TL;DR: A new Byzantine SMR called Dispel (Distributed Pipeline) that allows any node to distributively start new consensus instances whenever they detect sufficient resources locally and is evaluated in a cryptocurrency application with Bitcoin transactions and shows that this SMR is not the bottleneck.
Journal ArticleDOI

Authentication Challenges in a Global Environment

TL;DR: The Scalable Authentication Infrastructure for Next-generation Trust (SAINT), which partitions the Internet into groups with common, local trust roots and isolates the effects of a compromised trust root, and makes trust root management a central part of the network architecture.
Posted Content

Microsecond Consensus for Microsecond Applications

TL;DR: Mu is proposed, a system that takes less than 1.3 microseconds to replicate a (small) request in memory, and less than a millisecond to fail-over the system - this cuts the replication and fail- over latencies of the prior systems by at least 61% and 90%.
Proceedings Article

Fine-grained consistency for geo-replicated systems

TL;DR: A novel fine-grained consistency definition, Partial Order-Restrictions consistency (or short, PoR consistency), generalizing the trade-off between performance and the amount of coordination paid to restrict the ordering of certain operations is presented.
Patent

Byzantine fault quantifying clock synchronization

TL;DR: In this article, a message from a computing device is propagated up a network tree of devices to a device having a reference time, which encodes the reference time and returns the message down the tree.
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)