Category:Concurrency control
![]() | Computing portal |
Here is a list of articles in the Concurrency control category of the Computing portal that unifies foundations of mathematics and computations using computers.
Subcategories
This category has the following 3 subcategories, out of 3 total.
C
T
Pages in category "Concurrency control"
The following 75 pages are in this category, out of 75 total.
- Concurrency control (computing)
A
- ACID (computing)
- ACID (computer science) (computing)
- Advanced Synchronization Facility (organization)
- Atomic semantics (physics)
B
- Busy waiting (computing)
C
- Commitment ordering (computing)
- Compare-and-swap (computing)
- Conservative two-phase locking (computing)
- Construction and Analysis of Distributed Processes (software)
- Critical section (computing)
D
- Distributed concurrency control (computing)
- Double compare-and-swap (computing)
- Double-checked locking (computing)
E
- E-LOTOS (computing)
- Ease (programming language) (computing)
- Event (synchronization primitive) (computing)
F
- Fetch-and-add (computing)
- Funnel (concurrent computing) (computing)
- Futex (computing)
G
- Giant lock (computing)
- Global concurrency control (computing)
- Global interpreter lock (computing)
- Global serializability (computing)
I
- Index locking (computing)
L
- Language Of Temporal Ordering Specification (computing)
- Lease (computer science) (computing)
- Linearizability (computing)
- Lock (computer science) (computing)
- Lock convoy (computing)
- Locks with ordered sharing (computing)
M
- Modular concurrency control (computing)
- Modular serializability (computing)
- Monitor (synchronization) (computing)
- Multiple granularity locking (computing)
- Multiversion concurrency control (computing)
- Mutual exclusion (computing)
N
- Non-blocking algorithm (computing)
- Non-lock concurrency control (computing)
O
- Operational transformation (computing)
- Optimistic concurrency control (computing)
- Overlapped IO (computing)
P
- Path expression (computing)
- Priority ceiling protocol (computing)
- Priority inheritance (computing)
- Priority inversion (computing)
R
- Read-copy-update (computing)
- Read-modify-write (computing)
- Read–modify–write (computing)
- Readers–writer lock (computing)
- Record locking (computing)
- Reentrant mutex (computing)
- Regular semantics (computing)
- Room synchronization (computing)
S
- Safe semantics (computing)
- Semaphore (programming) (computing)
- Seqlock (computing)
- Serializability (computing)
- Serializing tokens (computing)
- Snapshot isolation (computing)
- Software lockout (software)
- Software transactional memory (computing)
- Speculative multithreading (computing)
- Squatting attack (computing)
- Strong strict two-phase locking (computing)
T
- Test and test-and-set (computing)
- Test-and-set (computing)
- Thundering herd problem (computing)
- Timestamp-based concurrency control (computing)
- Timestamping (computing) (computing)
- Transactional memory (computing)
- Transactional Synchronization Extensions (computing)
- Two-phase locking (computing)
V
- Volatile (computer programming) (computing)
W
- Wait-for graph (computing)