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.
翻译：我们研究不同共有对象类型在碰撞和回收的系统中使用非挥发性共同记忆解决可恢复的共识的能力。特别是,我们将解决可恢复性共识的困难与解决标准无等待性共识问题的困难进行比较,在系统解决标准的无阻性共识问题的困难与停止失败的难度进行比较。我们侧重于单个进程可能崩溃和回收的模式,以及配备阅读操作的大型对象类型。我们描述可读性对象类型,这些类型能够解决特定程序之间可恢复的共识。我们使用这一特性,我们表明,使用可读性类型可以解决共识的进程数量可能大于使用该类型能够解决可恢复性共识的进程数量,但仅略多一点。
相关内容
微信扫码咨询专知VIP会员