simplePaxos Made Simple

LeaderLeaderPhasePhasePhasevaluenoopnoop

PODCPaxosFred SchneiderButler Lampson

AcceptorProposerProposerAcceptor

PaxosLeaderLeader

ProposersProposersProposerPhase

Using the same proposal numberPaxosMultiPaxosPaxos Made Moderately Complex [ Jerry Lee ]

LeaderLeaderLeadernoopPhase[**]noop

[]LeaderLeaderPhase[¶¶]PaxosPhase

accpetoraccpetorProposerAcceptorAcceptoracceptAcceptoracceptAcceptorAcceptormajority[]

AcceptorSCnvaluev

The Paxos algorithm, when presented in plain English, is very simple.[*]

PcProposernAcceptornProposerProposerAcceptorsn

Paxos

value

LamportPaxosLamportLamportTOCSLamportPaxosViewstamped Replication A New Primary Copy Method to Support HighlyAvailable Distributed SystemsPaxos

PcProposer n, vAcceptor SSacceptnSAcceptornvProposerPbPbPcPcPbm, v

LearnerLearnerAcceptorLearnervalueLearnersLearnersLearnerAcceptorsLearners

LeaderPhase

LeaderPhasePhasevalueLeaderLeaderLeaderPhaseLeader

Pbmvaluevnn mvaluevnm..nvaluevnvaluevmAcceptorAcceptorm

AcceptorAcceptorprepareLeaderPhaseI

Leslie Lamport. The implementation of reliable distributed multiprocess systems. Computer Networks, , .

ProposersAcceptorsLearners

Leslie Lamport. The parttime parliament. ACM Transactions on Computer Systems, , May .

PAcceptor

AcceptorProposerPbPaP

PAcceptorAcceptoracceptAcceptorvalueAcceptorvalue[¶]

preparennAcceptorprepareprepareAcceptorprepareP

ProposerAcceptorProposerprepareacceptAcceptorprepareacceptaccept

[]PaxosLeaderLeaderLeaderLeaderLeaderLeadervaluevalueiLeaderprogress

AcceptorsLearnersvalueLearnersLearners

Paxos[][]synodPaxos[]

Leaderi[][♠♠]

LeaderLearner,,PhasePhase[♣]

AcceptorAcceptorPaxosLearnerAcceptorvalueLearnerAcceptorLearnervaluevaluevalueAcceptorAcceptorAcceptorPhaseAcceptorAcceptor n / Acceptor

PbPaPPP P

LearnerAcceptorAcceptorLearnersLearnersAcceptorLearner

ProposerProposerAcceptorprepareprepareacceptProposerProposer

AcceptorLearnerslearnsvalueAcceptors

,Pcn, vv vn m

Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, , July .

ProposerAcceptorLearnerLeaderProposerLeaderLeadervalueLeaderPaxosvaluePhaseProposerPhasevalueProposer

PaxosWikiMultiPaxoswikiLeaderPhaseLeaderPhasevalue

ProposerAcceptorsAcceptorsAcceptorsaccept

valueLearnersLearnerAcceptorsAcceptorAcceptorsLearnersvalueLearnervalueProposer[♥]

Idit Keidar and Sergio Rajsbaum. On the cost of ulttolerant consensus when there are no ultsa tutorial. TechnicalReport MITLCSTR, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, , May . also published in SIGACT News June .

accpetorProposeraccpetorAcceptoraccpetor

Liveness[†]

PAcceptorcProposervaluePcPaPPaPa

PhaseProposerqPhaseProposerpnPhaseacceptAcceptorsnProposerpnn nPhasePhaseProposerqacceptProposerProposerAcceptorsProposerProposerAcceptorsProposerFLP[]Proposer[♦]

PhaseLeaderLeaderLeaderLeaderMajorityProposerPhase

PhasevalueProposervaluenoop

PhasePhase [ Jerry Lee ]

ProposerAcceptornvaluealueProposer

Paxos[]ProposerAcceptorLearnerLeaderProposerLearnerPaxosAcceptorAcceptor

Pc. nvnvaluevAcceptorS a b

Michael J. Fischer, Nancy Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one ulty process. Journal of the ACM, , April .

ProposernAcceptorsAcceptor

AcceptorP

AcceptorAcceptorvalue

i LeaderPhase[††]PhaseAcceptorProposerPhaseAcceptorPhase[‡‡]

ProposersAcceptorAcceptorsAcceptor[]

Lamportmy writingsmy writingsLamportThe Byzantine General ProblemPaxosThe PartTime Parliament[]

This entry was posted in simple machine and tagged . Bookmark the permalink.

Comments are closed.