论寄存器对可计算性的重要性
On the Importance of Registers for Computability
摘要:
文献中的所有共识层次结构都假设我们除了拥有给定对象的副本之外,还拥有无限数量的寄存器。但我们为什么真的需要这些记录?本文考虑了如果一个人试图使用各种对象但没有任何寄存器来解决共识会发生什么。我们表明,在一个合理的假设下,对象,如队列和堆栈不能模拟丢失的寄存器。我们还表明,也许令人惊讶的是,初始化,没有计算的后果时,寄存器是现成的,是至关重要的,在确定对象的同步功率时,不允许寄存器。最后,我们表明,没有寄存器,可用对象的数量会影响可以解决的共识水平。因此,我们的工作提出了一个问题,是否共识层次结构,假设一个无限数量的寄存器真正捕获同步功率,并开始了一系列的研究,旨在更好地了解读写内存和强大的同步操作之间的相互作用,在现代架构。
英文摘要:
All consensus hierarchies in the literature assume that we have, in addition to copies of a given object, an unbounded number of registers. But why do we really need these registers? This paper considers what would happen if one attempts to solve consensus using various objects but without any registers. We show that under a reasonable assumption, objects like queues and stacks cannot emulate the missing registers. We also show that, perhaps surprisingly, initialization, shown to have no computational consequences when registers are readily available, is crucial in determining the synchronization power of objects when no registers are allowed. Finally, we show that without registers, the number of available objects affects the level of consensus that can be solved. Our work thus raises the question of whether consensus hierarchies which assume an unbounded number of registers truly capture synchronization power, and begins a line of research aimed at better understanding the interaction between read-write memory and the powerful synchronization operations available on modern architectures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。