Property of some operation(s) in concurrent programming
This article duplicates the scope of other articles, specifically serializability and atomicity (database systems). Please discuss this issue and help introduce a summary style to the article.(November 2018)
In grey a linear sub-history, processes beginning in b do not have a linearizable history because b0 or b1 may complete in either order before b2 occurs.
In concurrent programming, an operation (or set of operations) is linearizable if it consists of an ordered list of invocation and response events, that may be extended by adding response events such that:
The extended list can be re-expressed as a sequential history (is serializable).
That sequential history is a subset of the original unextended list.
Informally, this means that the unmodified list of events is linearizable if and only if its invocations were serializable, but some of the responses of the serial schedule have yet to return.[1]
In a concurrent system, processes can access a shared object at the same time. Because multiple processes are accessing a single object, a situation may arise in which while one process is accessing the object, another process changes its contents. Making a system linearizable is one solution to this problem. In a linearizable system, although operations overlap on a shared object, each operation appears to take place instantaneously. Linearizability is a strong correctness condition, which constrains what outputs are possible when an object is accessed by multiple processes concurrently. It is a safety property which ensures that operations do not complete unexpectedly or unpredictably. If a system is linearizable it allows a programmer to reason about the system.[2]
^Cite error: The named reference :0 was invoked but never defined (see the help page).
^Shavit, Nir; Taubenfel, Gadi (2016). "The Computability of Relaxed Data Structures: Queues and Stacks as Examples" (PDF). Distributed Computing. 29 (5): 396–407. doi:10.1007/s00446-016-0272-0. S2CID 16192696.
unexpectedly or unpredictably. If a system is linearizable it allows a programmer to reason about the system. Linearizability was first introduced as a consistency...
order in which they were actually issued. Concurrent data structure Linearizability Serializability Leslie Lamport, "How to Make a Multiprocessor Computer...
Eventual consistency is a weak guarantee – most stronger models, like linearizability, are trivially eventually consistent. Eventually-consistent services...
Gridlock (in vehicular traffic) Hang (computing) Impasse Infinite loop Linearizability Model checker can be used to formally verify that a system will never...
Academy of Engineering in 2013 for concurrent computing techniques for linearizability, non-blocking data structures, and transactional memory. 2003 Dijkstra...
correct - Ctrie operations have been shown to have the atomicity, linearizability and lock-freedom properties. Judy array Radix tree Phil Bagwell (2000)...
document validations moved from V8 to SpiderMonkey 3.4 November 29, 2016 linearizable read concerns views collation 3.6 November 2017 4.0 June 2018 transactions...
correct - Ctrie operations have been shown to have the atomicity, linearizability and lock-freedom properties. The lookup operation can be modified to...
the non-linearizability of irrational indifferent fixed points, while Carl Ludwig Siegel in 1942 gave conditions which imply the linearizability of such...
Contrast to strong consistency models, such as sequential consistency or linearizability, which cannot be both safe and live under partition, and are slow to...
properties of a concurrent data structure (such as serializability, linearizability, sequential consistency, and quiescent consistency) specify the structures...
linearizable. Since this reasoning does not rely on a particular history H, it implies that the register is atomic. Since atomicity (linearizability)...
serializability problem and its proposed solutions are described. Linearizability, a more general concept in concurrent computing. Philip A. Bernstein...
Other solutions are Non-blocking algorithms and Read-copy-update. Linearizability – Property of some operation(s) in concurrent programming Lock (computer...
consistency model which has deliberately made the trade-off of having non-linearizable transaction histories. Transactions containing overlapping keys are guaranteed...
1016/0167-6911(83)90037-3 Krener, A.J.; Respondek, W. (1985), "Nonlinear observers with linearizable error dynamics", SIAM Journal on Control and Optimization, 23 (2): 197–216...
page at the ACM Digital Library Herlihy, M. P.; Wing, J. M. (1990). "Linearizability: A correctness condition for concurrent objects". ACM Transactions...
program. All memory operations need to happen in the program order. Linearizability (also known as atomic consistency or atomic memory) can be defined...
versions of an item or some specified time window Strong consistency (or linearizable) ensures that clients always read the latest globally committed write...
maximum performance. The Java programming language does not guarantee linearizability, or even sequential consistency, when reading or writing fields of...
convergence for the Legendre pseudospectral optimal control of feedback linearizable systems". Journal of Control Theory and Applications. 8 (4): 391–405...
sequence where all operations are ordered by their τ values. Atomic/Linearizable register: Termination: when a node is correct, sooner or later each read...
overlaps with. An atomic register satisfies the stronger condition of being linearizable. Registers can be characterized by how many processes can access with...
is normal, then some tensor power L n {\displaystyle L^{n}} of L is linearizable. Also, if L is very ample and linearized, then there is a G-linear closed...
introduced the concept of “normality” which extends the well-known linearizability consistency condition to the case where objects have polyadic operations...
Global Information
