Paxos Made Simple

By Leslie Lamport. 2001

1,887 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/02b1103e592fa6bf0499e27f1519692441fad557

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Towards Scaling Blockchain Systems via Sharding (2018, unknown): “soft Coco [8] implements the entire consensus protocol in a trusted execution environment, reducing the failure model to crash failure. As a result, more ecient protocols such as Raft [51] and Paxos [38, 37] can be used. However, this approach incurs a much larger TCB than AHL+, making it more vulne”
This paper is included in the Proceedings of the 2022 USENIX Annual Technical Conference. (unknown): “For example, in the Paxos paper [39], after a proposer sends out the proposal, “ if the proposer receives a response from a majority of acceptors... ” In practice, many projects started with the asynchronous callback style, but the growing size of codebase and the accompanying cognitive load of…”
A Survey about Consensus Algorithms Used in Blockchain (2018, methodology): “3.2.2 Crash fault tolerance based consensus Motivated by the classical and difficult-to-understand consensus algorithm called Paxos [65], Raft [80] is a consensus algorithm that is used by Quorum [81] to tolerate crashes.”
A Comprehensive Review of Blockchain Consensus Mechanisms (2021, background): “To reach consensus in paxos, the proposer should receive at least N / 2 − 1 acceptances ( N is the number of proposals) from the acceptors [16].”
Mencius: Building Efficient Replicated State Machine for WANs (2008, unknown): “We omit a formal description of the assumptions, and we refer readers to [9, 10, 21, 22] for details.”
Gorilla: A Fast, Scalable, In-Memory Time Series Database (2015, methodology): “Within each region, a Paxos-based [6, 14] system called ShardManager assigns shards to nodes.”
A Vademecum on Blockchain Technologies: When, Which, and How (2019, methodology): “The state machine replication (SMR) technique [59] enables the construction of fault-resilient consensus protocols; robust against crash failures in trusted environments (e.g., Paxos and RAFT [60, 61]) and additionally capable of tolerating Byzantine failures in networks of untrusted parties (e.g., ”
The Chubby lock service for loosely-coupled distributed systems (2006, background): “Asynchronous consensus is solved by the Paxosprotocol [12, 13].”
A Hitchhiker's Guide On Distributed Training of Deep Neural Networks (2018, background): “ral modiﬁcations proposed in the Raft protocol in systems like Zookeeper [32], Kafka [33] to name a few. All of these consensus algorithms that maintain state come from the Paxos family of algorithms [34], [35]. Raft is popular for it’s practicability and boasts the same fault tolerance and speed of”
Fast Paxos (2006, methodology): “The classic Paxos algorithm [7,9] is popular because it”
Scaling Distributed Machine Learning with the Parameter Server (2014, unknown): “Given the potentially complex task dependency graph and the need for fast recovery, each (key,value) pair is associated with a vector clock [30, 15], which records the time of each individual node on this (key,value) pair.”
Paxos made live: an engineering perspective (2007, background): “Consensus is reached once a majority of replicas receive the accept message from the coordinator and acknowledge it.”
Chainspace: A Sharded Smart Contracts Platform (2017, background): “There are many options for ensuring that concerned nodes in each shards do not reach an inconsistent state for the accepted transactions, such as Nakamoto consensus through proof-of-work [Nak08], two-phase commit protocols [LL94], and classical consensus protocols like Paxos [L + 01], PBFT [CL + 99]”
Proposal Scaling Distributed Machine Learning with System and Algorithm Co-design (2016, unknown): “In our PS, given the potentially complex task dependency graph and the need for fast recovery, each (key,value) pair is associated with a vector clock [43, 78], which records the time of each individual node on this (key,value) pair.”