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
Proceedings ArticleDOI

Efficient and Deterministic Scheduling for Parallel State Machine Replication

TL;DR: A new and highly efficient scheduler for parallel state machine replication that considers batches of commands, instead of commands individually, and is augmented with a compact data structure that encodes commands information needed to the dependency analysis.
Journal ArticleDOI

Availability analysis of a permissioned blockchain with a lightweight consensus protocol

TL;DR: The reliability and availability analysis of the LightWeight Mining (LWM) protocol for securing data provenance is presented and shows the reliability of the protocol and its ability to protect against malicious miner DoS attacks.
Proceedings Article

Asynchronous leasing

TL;DR: This paper gives precise properties of the lease abstraction, and shows how it can be implemented in an asynchronous system model with a logical notion of time, and illustrates its use by showing how it significantly improves the performance of a consensus-based total-order broadcast algorithm.
Journal Article

Hybrid-BFT: Optimistically Responsive Synchronous Consensus with Optimal Latency or Resilience.

TL;DR: This paper provides a tight upper bound on the number of actual faults by showing matching feasibility and infeasibility results, and presents a simple leaderbased Byzantine fault-tolerant (BFT) replication protocol as a practical application.
Journal Article

The committee decision problem

TL;DR: All three problems are wait-free unsolvable in a read/write shared memory system, and they are all solvable if the system is enriched with objects capable of solving (2,3)-set agreement.
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)