Jump to content

Paxos (computer science)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Allen Hobby (talk | contribs) at 12:45, 20 March 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

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.

See also

Stub icon

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

Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Paxos_(computer_science)&oldid=116513641"