Consistency models with global operation sequencing and their composition (extended version)
Consistency models with global operation sequencing and their composition (extended version)
复制标题
具有全局操作排序的一致性模型及其组成（扩展版）
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
S. Burckhardt
中科院分区：
文献类型：
--
作者：
Alexey Gotsman;S. Burckhardt
现代分布式系统通常通过提供关于它们管理的数据的一致性保证来实现可用性和可伸缩性，而这些数据的一致性保证弱于线性化。我们考虑一类这样的一致性模型，尽管这种削弱，保证客户端最终同意一个全球性的操作序列，同时看到这个最终序列的子序列在任何给定的时间点。这种模型的例子包括经典的总存储顺序（TSO）和最近提出的双TSO，全球序列协议（GSP）和有序序列一致性。
我们定义了一个统一的模型，称为全球序列一致性（GSC），上述模型作为其特殊情况下，并调查其关键属性。首先，我们提出了一个条件下，每个满足GSC的多个对象可以组成，使整个对象集满足GSC。其次，我们证明了GSC的特殊情况-GSP，TSO和双TSO之间的一个有趣的关系：我们表明，不进行带外通信的客户端不能分辨这些模型之间的区别。为了得到这些结果，我们提出了一种新的公理化规格的GSC和证明其等价的操作定义的模型。
Modern distributed systems often achieve availability and scalability by providing consistency guarantees about the data they manage weaker than linearizability. We consider a class of such consistency models that, despite this weakening, guarantee that clients eventually agree on a global sequence of operations, while seeing a subsequence of this final sequence at any given point of time. Examples of such models include the classical Total Store Order (TSO) and recently proposed dual TSO, Global Sequence Protocol (GSP) and Ordered Sequential Consistency.
We define a unified model, called Global Sequence Consistency (GSC), that has the above models as its special cases, and investigate its key properties. First, we propose a condition under which multiple objects each satisfying GSC can be composed so that the whole set of objects satisfies GSC. Second, we prove an interesting relationship between special cases of GSC---GSP, TSO and dual TSO: we show that clients that do not communicate out-of-band cannot tell the difference between these models. To obtain these results, we propose a novel axiomatic specification of GSC and prove its equivalence to the operational definition of the model.
影响因子：
1.1
作者：
Filipovic I
通讯作者：
Filipovic I