在$n$过程之外的$k$之间达成一致
Reaching Agreement Among $k$ out of $n$ Processes
摘要:
在协议问题中,每个过程都有一个输入值,必须选择一个决策(输出)值。给定$n\geq 2$进程和$m \geq 2$可能的不同输入值,我们希望设计一种协议算法,使尽可能多的进程能够在$t$崩溃失败的情况下决定其中一个进程的(相同)输入值。在没有通信的情况下,当每个进程简单地决定其输入值时,至少$\lceil (n-t)/m \rceil$进程被保证总是决定相同的值。我们能在沟通方面做得更好吗?对于某些情况,例如当$m=2$时,即使在存在单个崩溃故障的情况下,在确定性异步系统中,答案也是否定的,其中通信是通过使用原子读/写寄存器或通过发送和接收消息。在其他情况下,答案是肯定的。
英文摘要:
In agreement problems, each process has an input value and must choose a decision (output) value. Given $n\geq 2$ processes and $m \geq 2$ possible different input values, we want to design an agreement algorithm that enables as many processes as possible to decide on the (same) input value of one of the processes, in the presence of $t$ crash failures. Without communication, when each process simply decides on its input value, at least $\lceil (n-t)/m \rceil$ of the processes are guaranteed to always decide on the same value. Can we do better with communication? For some cases, for example when $m=2$, even in the presence of a single crash failure, the answer is negative in a deterministic asynchronous system where communication is either by using atomic read/write registers or by sending and receiving messages. The answer is positive in other cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。