Paxos (computer science): Difference between revisions
Content deleted Content added
| Line 13: | Line 13: | ||
* [http://pine.cs.yale.edu/pinewiki/Paxos Yale University's Wiki article] |
* [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://research.microsoft.com/users/lamport/pubs/pubs.html#lamport-paxos Leslie Lamport's history of the paper] |
||
* [http://labs.google.com/papers/ |
* [http://labs.google.com/papers/chubby.html Google Whitepaper: Chubby Distributed Lock Service] |
||
* [http://labs.google.com/papers/bigtable-osdi06.pdf#search=%22google%20chubby%20pdf%22 Google Whitepaper: Bigtable A Distributed Storage System for Structured Data] |
|||
{{compsci-stub}} |
{{compsci-stub}} |
||
Revision as of 00:17, 5 January 2007
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.
See also
External links
- Yale University's Wiki article
- Leslie Lamport's history of the paper
- Google Whitepaper: Chubby Distributed Lock Service
- Google Whitepaper: Bigtable A Distributed Storage System for Structured Data
 | This computer science article is a stub. You can help Wikipedia by expanding it. |