
PDF Publication Title:
Text from PDF Page: 129
CHAPTER 7. EPOCHS REVISED 129 Algorithm 29: Proposer algorithm with epochs by recovery and counting quorums. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 state : • k: size of counting quorum (configured, persistent) emax ← nil QP,QA←∅ ife=nilthen e ← 0, v ← γ, goto line 24 else e←e+1 ∀a∈A:R[a]←no Vdec ← ∅ /* Start of Phase 1 for proposal e */ send prepare( e) to acceptors while|QP|≤na −k∨|Vdec|>1do switch do case promise(e,f,w) received from acceptor a QP ←QP ∪{a} if f ̸= nil ∧ (emax = nil ∨ f > emax) then emax ← f R[a] ← (f, w) Vdec ←v∈V|{a∈A|R[a]=(emax,v)}|≥k+|QP|−na case timeout goto line 1 if Vdec = ∅ then v←γ else v ← only(Vdec) /* Start Phase 2 for proposal (e,v) */ send propose( e,v) to acceptors while |QA| < k do switch do case accept( e ,v) received from acceptor a QA ← QA ∪ {a} case timeout goto line 1 return vPDF 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 | RSS | AMP |