The power of processor consistency
The power of processor consistency
复制标题
处理器一致性的力量
DOI：
10.1145/165231.165264
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
G. Neiger
中科院分区：
文献类型：
--
作者：
M. Ahamad;R. Bazzi;Ranjit John;Prince Kohli;G. Neiger
与传统的顺序一致性或原子性内存相比，一致性保证较弱的共享内存被认为是构建可扩展系统的关键。一种有影响力的内存模型——处理器一致性，在文献中被广泛引用，但是由于缺乏精确的形式化定义，关于它的能力存在相互矛盾的说法。我们使用一个形式化模型给出了处理器一致性的两种不同定义：一种对应古德曼最初的提议，另一种对应DASH系统实现者给出的定义。这些定义是非操作性的，并且可以很容易地与其他类型的内存相关联。为了说明处理器一致性的能力，我们展示了一个在处理器一致性下正确的互斥问题的非协作解决方案。作为对比，我们表明兰波特的面包店算法在处理器一致性下是不正确的。
Shared memories that provide weaker consistency guarantees than the traditional sequentially consistent or atomic memories have been claimed to provide the key to building scalable systems. One influential memory model, processor considency, has been cited widely in the literature but, due to the lack of a precise and formal definition, contradictory claims have been made regarding its power. We use a formal model to give two distinct definitions of processors consistency: one corresponding to Goodman’s original proposal and the other corresponding that given by the implementors of the DASH system. These definitions are non-operational and can be easily related to other types of memories. To illustrate the power of processor consistency, we exhibit a non-cooperative solution to the mutual exclusion problem that is correct with processor consistency. As a contrast, we show that Lamport’s Bakery algorithm is not correct with processor consistency.