Revision as of 01:18, 25 September 2006

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.

Real World Use

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.

External links

This computer science article is a stub. You can help Wikipedia by expanding it.

@@ Line 1: / Line 1: @@
 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 machine]]s.
+= Real World Use =
+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.
 ==See also==
@@ Line 9: / Line 13: @@
 * [http://pine.cs.yale.edu/pinewiki/Paxos Yale University's Wiki article]
 * [http://research.microsoft.com/users/lamport/pubs/pubs.html#lamport-paxos Leslie Lamport's history of the paper]
+* [http://labs.google.com/papers/bigtable-osdi06.pdf#search=%22google%20chubby%20pdf%22 Bigtable: A Distributed Storage System for Structured Data]
 {{compsci-stub}}