Paxos algorithm
From Wikipedia, the free encyclopedia
The Paxos algorithm, originally proposed by Leslie Lamport in a paper submitted in 1990 but not published until 1998, is a fault tolerant algorithm for reaching consensus in a distributed system. Within the algorithm, consensus is defined as a decision on an input value for a set of replicated state machines.
[edit] Usage
Google uses the Paxos algorithm in their Chubby distributed lock service in order to keep replicas consistent in case of failure. Chubby is used by Bigtable which is now in production in Google in Google Analytics and other products.
[edit] See also
- Chandra-Toueg consensus algorithm
- State machine
