arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.06139cs.DC
收藏

一种基于复杂度的多处理机同步体系结构

A Complexity-Based Hierarchy for Multiprocessor Synchronization

Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu

摘要:

多年来,Herlihy基于可计算性的共识层次结构一直是我们在确定性算法中使用各种类型的多处理器同步对象时的相对能力的最佳解释。然而,这种层次结构的关键是将同步指令视为不同的对象,这种方法与现实世界相去甚远,在现实世界中,多处理器程序将同步指令应用于任意内存位置的集合。我们惊讶地意识到,当考虑应用于内存位置的指令时,基于可计算性的层次结构崩溃了。这就留下了一个问题,即如何更好地捕捉各种同步指令的能力。在本文中,我们提供了一种方法来回答这个问题。我们提出了一个层次的同步指令,分类的空间复杂度在解决无障碍共识。我们的层次结构提供了一个已知指令组合的分类,这似乎符合我们的直觉,即一些指令在实践中有多有用,而另一些指令的有效性则受到质疑。我们证明了缓冲读写指令的能力的一个本质上严格的特征。有趣的是,我们对多位置原子分配也给出了类似的结果。

英文摘要:

For many years, Herlihy's elegant computability based Consensus Hierarchy has been our best explanation of the relative power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this hierarchy is treating synchronization instructions as distinct objects, an approach that is far from the real-world, where multiprocessor programs apply synchronization instructions to collections of arbitrary memory locations. We were surprised to realize that, when considering instructions applied to memory locations, the computability based hierarchy collapses. This leaves open the question of how to better capture the power of various synchronization instructions. In this paper, we provide an approach to answering this question. We present a hierarchy of synchronization instructions, classified by their space complexity in solving obstruction-free consensus. Our hierarchy provides a classification of combinations of known instructions that seems to fit with our intuition of how useful some are in practice, while questioning the effectiveness of others. We prove an essentially tight characterization of the power of buffered read and write instructions.Interestingly, we show a similar result for multi-location atomic assignments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑