From serializable to causal transactions for collaborative applications
From serializable to causal transactions for collaborative applications
复制标题
协作应用程序从可序列化事务到因果事务
DOI：
--
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
M. Ahamad
中科院分区：
文献类型：
--
作者：
M. Raynal;G. Thia;M. Ahamad
分散式分布式系统中的服务可以使用共享的分布式对象来实现。当这些对象被并发访问时，可序列化性（传统的一致性标准）可以用来定义它们的执行行为。然而，这种一致性标准有一个主要缺点，因为它对应用程序的执行施加了很强的同步约束，而在分散的系统中无法有效地满足这些约束。在本文中，我们研究了对共享对象的访问分组形成事务的计算的弱一致性准则。事务提供的保证（例如并发性和故障原子性）使它们在计算操作长寿命对象的状态时具有吸引力。我们探索了两个新的准则：因果一致性和因果序列化性。这些标准对于一类应用程序（例如协作应用程序）来说已经足够了，它们的实现可以减少同步，从而提高自主性、可用性和性能。对这些标准进行了正式定义，并给出了实现这些标准的协议。
Services in decentralized distributed systems can be implemented using shared distributed objects. When these objects are accessed concurrently, serializability (the traditional consistency criterion) can be used to define their execution behaviour. However, this consistency criterion has a major drawback because it imposes strong synchronization constraints on the execution of applications which cannot be met efficiently in decentralized systems. In this paper, we examine weaker consistency criteria for computations in which accesses to shared objects are grouped to form transactions. The guarantees provided by transactions (e.g. concurrency and failure atomicity) make them attractive when computations manipulate the state of long-lived objects. We explore two new criteria: causal consistency and causal serializability. These criteria turn out to be sufficient for a class of applications (e.g. collaborative applications) and their implementation results in lesser synchronization and hence improved autonomy, availability and performance. These criteria are formally defined and protocols implementing them are presented.