A Bound on the Rounds to Reach Lattice Agreement
A Bound on the Rounds to Reach Lattice Agreement
复制标题
达成格子协议的轮数限制
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
M. Mavronicolas
中科院分区：
文献类型：
--
作者：
M. Mavronicolas
晶格协议决策问题在分布式计算的同步消息传递模型中进行了研究，但要碰撞故障处理器p p p p p p p pn以输入值x x x x N开始，x x xn是从晶格中绘制的，l l lattice l l lattice l属于最大元素的大小，该元素的最大元素链链可以是可以de ned ned ned元素开始使用fx x xng，因为其他元素的加入表示joinheight l fx x xng xng每个非故障处理器选择一个大于或大于或等于其原始价值，小于或等于原始值的连接超过所选值，必须成对可比，因此晶格协议是削弱传统共识的早期停止算法的较强共识问题的弱点，可以重新查询F回合。沟通的任何执行情况下，f n处理器崩溃我们提出了一种早期停止算法的晶格协议，该算法是，其性能优于早期停止算法以达成共识的早期停止特定的每个非故障处理器在Minf JoinHeight L FX X X X XNG B P F CG回合中都决定了任何执行算法的执行，其中F N处理器特别崩溃了，该算法将其与Attiya等算法相似的Attiya等算法区分开来
The lattice agreement decision problem is studied in the synchronous message passing model of distributed computation subject to crash failures Processors p p pn start with input values X X Xn respectively drawn from a lattice L the size of a maximal chain of elements of L that can be de ned start ing with fX X Xng as the joins of other elements is denoted joinheight L fX X Xng Each non faulty processor chooses a value greater than or equal to its original value and less than or equal to the join of the original values more over the chosen values must be pairwise comparable Thus lattice agreement is a weakening of traditional consensus Early stopping algorithms for the stronger consensus problem are known to re quire f rounds of communication for any execution in which f n processors crash We present an early stopping algorithm for lattice agreement whose perfor mance is superior to early stopping algorithms for consensus More speci cally each nonfaulty processor decides within minf joinheight L fX X Xng b p f cg rounds for any execution of the algorithm in which f n processors crash In particular this algorithm distinguishes itself from a comparable algorithm of Attiya et al that requires lgn communication rounds in every execution