论文标题
什么时候可以收回的共识比共识更难？
When Is Recoverable Consensus Harder Than Consensus?
论文作者
论文摘要
我们研究了不同共享对象类型在具有崩溃和恢复的系统中使用非挥发性共享内存来解决可恢复共识的能力。特别是，我们将解决可回收共识的困难与解决停止故障的系统中的标准无等待共识问题的难度进行了比较。我们专注于单个过程可能崩溃和恢复的模型以及配备读取操作的大量对象类型。我们表征可以在给定数量的过程中解决可恢复共识的可读对象类型。使用此表征，我们表明，可以使用可读类型解决共识的过程数量可以大于可以使用该类型来解决可回收共识的过程数量，但仅稍大。
We study the ability of different shared object types to solve recoverable consensus using non-volatile shared memory in a system with crashes and recoveries. In particular, we compare the difficulty of solving recoverable consensus to the difficulty of solving the standard wait-free consensus problem in a system with halting failures. We focus on the model where individual processes may crash and recover and the large class of object types that are equipped with a read operation. We characterize the readable object types that can solve recoverable consensus among a given number of processes. Using this characterization, we show that the number of processes that can solve consensus using a readable type can be larger than the number of processes that can solve recoverable consensus using that type, but only slightly larger.
