A concurrent computation is linearizable if it is equivalent to a legal sequential computation
- local property : objects are linearizable => system is linearizable
- nonblocking property : process invoking totally defined operations never forced to wait => better concurrency
From wikipedia:
A history is linearizable if:
- its invocations and responses can be reordered to yield a sequential history
- that sequential history is correct according to the sequential definition of the object
- if a response preceded an invocation in the original history, it must still precede it in the sequential reordering (distinction from serializability)
