linearizability
Sign in to savethumb|In grey a linear sub-history, processes beginning in do not have a linearizable history because or may complete in either order before occurs.
~20 min read
Article
16 sectionsContents
- History
- Definition
- Linearizability versus serializability
- Linearization points
- Primitive atomic instructions
- High-level atomic operations
- Examples
- Counters
- Non-atomic
- Atomic
- Compare-and-swap
- Fetch-and-increment
- Locking
- See also
- References
- Further reading
thumb|In grey a linear sub-history, processes beginning in do not have a linearizable history because or may complete in either order before 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.
Connections
concurrent computing
Entity
non-blocking algorithm
Entity
conflict-free replicated data type
Entity
fetch-and-add
Entity
operating system
Entity
International Standard Book Number
Entity
Q15777
Entity
central processing unit
Entity
digital object identifier
Entity
compiler
Entity
sequence
Entity
denial-of-service attack
Entity
if and only if
Entity
object
Entity
ARM architecture
Entity
process
Entity
interrupt
Entity
Q845566
Entity
Spring Framework
Entity
thread
Entity