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

Tight failure detection bounds on atomic object implementations

TL;DR: The weakest failure detector for the basic register object is determined and it is shown to be the same for all popular atomic objects including test- and-set, fetch-and-add, queue, consensus and compare-and -swap.
Proceedings ArticleDOI

Paxos for System Builders: an overview

TL;DR: An overview of Paxos for System Builders, a complete specification of the Paxos replication protocol such that system builders can understand it and implement it and detail the safety and liveness properties guaranteed by the specification.
Journal ArticleDOI

ResilientDB: Global Scale Resilient Blockchain Fabric

TL;DR: GeoBFT as discussed by the authors is designed for excellent scalability by using a topological-aware grouping of replicas in local clusters, by introducing parallelization of consensus at the local level, and by minimizing communication between clusters.
Book ChapterDOI

Blockchain – From Public to Private

TL;DR: This writing seeks to provide the readers with some guidance on technological considerations when deciding to apply blockchain for commercial use.
Proceedings ArticleDOI

Conditions on input vectors for consensus solvability in asynchronous distributed systems

TL;DR: This paper introduces and explores a new condition based approach to solve the consensus problem in asynchronous systems by identifying sets of input vectors, called conditions, for which it is possible to design a protocol solving consensus despite the occurrence of up to f process crashes.
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)