Group protocol for distributed replicated objects
Group protocol for distributed replicated objects
复制标题
分布式复制对象的组协议
DOI：
10.1109/icpp.1998.708531
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
M. Takizawa
中科院分区：
文献类型：
--
作者：
T. Enokido;H. Higaki;M. Takizawa
在组协议中，对网络中传输的所有消息进行因果排序消耗了较大的计算和通信。客户端中的事务通过向服务器发送读和写请求来操作服务器中的对象。在本文中，我们定义了显着的消息，这是在应用程序级，通过使用事务之间的冲突关系。我们新提出了一个对象向量，因果顺序只有重要的消息。对象向量的模式在组成员的变化中是不变的。我们还展示了一个TBCO（基于事务的因果有序）协议采用的对象向量，通过该消息的数量被因果有序减少。
In group protocols, larger computation and communication are consumed to causally order all messages transmitted in the network. Transactions in clients manipulate objects in servers by sending read and write requests to the servers. In this paper we define significant messages, which are to be ordered at the application level, by using a conflicting relation among the transactions. We newly propose an object vector to causally order only the significant messages. The scheme of the object vector is invariant in the change of the group membership. We also show a TBCO (transaction-based causally ordered) protocol adopting the object vector; by which the number of messages to be causally ordered are reduced.