以下使用QC SC 和 L 代指三者。
动机
多线程执行，如何描述线程之间的相互关联的方法和强度。
-
QC适合描述计数器，只要保证计数不重不漏就可以了。 -
SC是现代架构读写内存的一种模式(使用fence 或者 memory barrier)。
In the end, the architectures do implement sequential
consistency, but only on demand. We discuss further issues related to sequential
consistency and the Java programming language in detail in Section 3.8.
-
L则是最强的要求，也是最常见的要求，比如queue stack 等数据结构的操作。
定义
QC要求当出现时间点没有任何程序执行的时候，那么该时间点之前和时间点之后的程序执行的顺序不可以改变。而
SC则要求，每一个线程函数调用都是按照程序顺序执行的，但是程序之间的顺序没有关系。 因为两个线程的函数调用的先后关系没有要求，所以，下面两种情况对于SC是等价的
// A:
P1 -- q.enq(x) -----------------------------
P2 ---------------------------- q.deq():x --
// B:
P1 ----------------------q.enq(x) ----------
P2 ---q.deq():x ----------------------------
- 当
L在SC的要求，如果两个函数调用没有重叠，那么函数调用顺序不可改变。所以对于上面举得例子，在L看来就是不同的，而且例子B没有就不满足L，因为q看到自己首先dequeu出来了x 然后才enqueue了一个x。还有一个很容易理解的说法，L希望程序的执行是瞬间发生，所以重叠的两个函数的顺序没有要求，但是不重叠的函数的顺序关系必须保持。
A sequential history H is legal if each object subhistory is legal for that object.
为什么要强调函数调用的移动，因为给定一个历史(History)，进行函数调用的移动总是为了将该历史变化为一个合法历史，如果先后顺序的约束强，那么意味着不能更加难以转换为合法历史。
关系
Linearizability 是 sequential consistency 的子集，因为 linearizability 是在 sequential consistency 的基础上添加了一个保持没有 overlapping 的顺序的要求。
-
quiescent consistency 和 sequential consistency 没有包含关系，其实容易理解，
仅仅满足
SC但是不满足L，
Compositional
何为组合: A correctness property is compositional if, whenever each object in the system satisfies , the system as a whole satisfies .
- quiescent consistency is compositional
Can we, in fact, compose a collection of independently implemented quiescently consistent objects to construct a quiescently consistent system? The answer is, yes: quiescent consistency is compositional, so quiescently consistent objects can be composed to construct more complex quiescently consistent objects
- Figure 3.8 说明 sequential consistency 不是 compositional 的。
-
L也是可组合的，证明方法是递归的方法(假设对于任意小于k个函数调用的历史是组合的)
Limit Concurrency
在当前上下文中间，not limit concurrency 其实只是说当前历史是符合某种一致性，比如顺序一致性，并且含有pending的inv，那么当其获得 response 的时候，可以保证历史还是满足该一致性。
Linearizability’s nonblocking property states that any pending invocation has a correct response, but does not talk about how to compute such a response.
三者都不会limit concurrency
- How much does quiescent consistency limit concurrency? Specifically, under what circumstances does quiescent consistency require one method call to block waiting for another to complete? Surprisingly, the answer is (essentially), never.
- How much does linearizability limit concurrency? Linearizability, like sequential consistency, is nonblocking. Moreover, like quiescent consistency, but unlike sequential consistency, linearizability is compositional; the result of composing linearizable objects is linearizable.
- Sequential consistency, like quiescent consistency, is nonblocking: any pending call to a total method can always be completed.
虽然三者都是不会limit concurrency 的，但是没有保证获得返回需要的步数，所以这三个一致性描述和wait free之类blocking描述其是对于一个函数或者对象两个维度的描述。
For now, it suffices to recall the two key properties of their design: safety, defined by consistency conditions, and liveness, defined by progress conditions
杂谈
- 证明一个函数是可线性化的一般方法是什么 ?
The usual way to show that a concurrent object implementation is linearizable is
to identify for each method a linearization point where the method takes effect.
For lock-based implementations, each method’s critical section can serve as its
linearization point. For implementations that do not use locking, the lineariza�tion point is typically a single step where the effects of the method call become
visible to other method calls.
- 对于可线性化的形式化证明体系，其基本的策略是什么 ?
TODO
