Exploiting write semantics in implementing partially replicated causal objects
Exploiting write semantics in implementing partially replicated causal objects
复制标题
利用写入语义来实现部分复制的因果对象
DOI：
--
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
M. Ahamad
中科院分区：
文献类型：
--
作者：
M. Raynal;M. Ahamad
为了支持对支持用户之间协作的对象的有效访问，需要在频繁访问对象的节点处复制对象。因果一致性是一个一致性标准，特别是有吸引力的对象共享的合作应用程序。它基于并发进程发出的读写操作的因果关系。它只要求所有进程都以其依赖顺序感知相互依赖的写入;因此，两个独立的写入可以由两个不同的进程以不同的顺序感知。在消息传递系统中，因果一致性通常由一个协议来实现，该协议确保所有消息的因果传递。在本文中，我们开发了一个新的协议，因果一致的共享对象，利用写语义，可以与更新消息。该协议允许提前传递更新消息，并可以丢弃携带过时值的消息。通过不要求所有更新消息以因果顺序递送，该协议提高了效率，减少了缓冲要求，并且与基于所有更新消息的因果递送来实现因果对象的协议相比非常有利。
To support efficient access to objects that support cooperation between users, the objects need to be replicated at nodes where they are frequently accessed. Causal consistency is a consistency criterion particularly attractive for objects shared in cooperative applications. It is based on a causality relation on read and write operations issued by concurrent processes. It only requires that writes that depend on one another be perceived in their dependence order by all processes; so, two independent writes can be perceived in a distinct order by two different processes. In message-passing systems causal consistency is usually implemented by a protocol that ensures causal delivery of all messages. In this paper we develop a new protocol for causally consistent shared objects that exploits the write semantics that can be associated with update messages. This protocol allows early delivery of update messages and can discard messages carrying obsolete values. By not requiring that all update messages be delivered in causal order this protocol improves efficiency, reduces buffering requirements and compares very favorably with protocols that implement causal objects based on causal delivery of all update messages.