CAUSAL MEMORY - DEFINITIONS, IMPLEMENTATION, AND PROGRAMMING
CAUSAL MEMORY - DEFINITIONS, IMPLEMENTATION, AND PROGRAMMING
复制标题
DOI：
10.1007/bf01784241
复制
发表时间：
1995-08-01
影响因子：
1.3
通讯作者：
HUTTO, PW
中科院分区：
文献类型：
--
作者：
AHAMAD, M;NEIGER, G;HUTTO, PW
共享存储器的抽象在分布式计算系统中越来越重要。传统的内存一致性确保所有进程都同意内存上所有操作的共同顺序。不幸的是，提供这些保证需要访问延迟，这会阻止扩展到大型系统。本文通过定义因果记忆来削弱这种保证，因果记忆是一种抽象概念，它确保系统中的进程在因果关系相关的操作的相对顺序上达成一致。因为因果记忆是弱一致性的，它比原子记忆或顺序一致性记忆允许更多的执行，因此也允许更多的并发。本文给出了因果记忆的形式化定义，并给出了一个消息传递系统的实现。此外，它还描述了一类实用的程序，如果开发的强一致的内存，正确运行的因果记忆。
The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by defining causal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that are causally related. Because causal memory is weakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory.