PDF Publication Title:
Text from PDF Page: 025
CHAPTER 2. CONSENSUS & CLASSIC PAXOS 25 Algorithm 1: Proposer algorithm for SAA 1 2 3 state : • γ: candidate value (configured, persistent) send propose( γ) to acceptor case accept( v) received from acceptor /* proposer learns that v was decided so return v */ return v p1 a1 p2 propose(A) accept(A) vacc :A propose(B) accept(A) Figure 2.1: Example run of SAA between one acceptor {a1} and two proposers {p1,p2}. Algorithm 2: Acceptor algorithm for SAA state : 1 2 3 4 5 • vacc: accepted value (persistent) while true do case propose( v) received from proposer if vacc = nil then vacc ← v send accept( vacc) to proposer Figure 2.1 is a message sequence diagram (MSD) for an example execution of the single acceptor algorithm. We will make extensive use of MSDs to illustrate the messages ex- changed and state updates which occur over time. Note that the time axis (the negative y-axis) is not assumed to be linear. In this example, proposer p1 has candidate value γ = A and proposer p2 has candidate value γ = B. The acceptor receives propose(A) first and therefore the value A is decided.PDF Image | Distributed consensus
PDF Search Title:
Distributed consensusOriginal File Name Searched:
UCAM-CL-TR-935.pdfDIY PDF Search: Google It | Yahoo | Bing
Cruise Ship Reviews | Luxury Resort | Jet | Yacht | and Travel Tech More Info
Cruising Review Topics and Articles More Info
Software based on Filemaker for the travel industry More Info
The Burgenstock Resort: Reviews on CruisingReview website... More Info
Resort Reviews: World Class resorts... More Info
The Riffelalp Resort: Reviews on CruisingReview website... More Info
CONTACT TEL: 608-238-6001 Email: greg@cruisingreview.com (Standard Web Page)