Category:Concurrency control

• Concurrency control

A

• ACID
• Advanced Synchronization Facility
• Asynchronous I/O
• Atomic semantics

B

• Barrier (computer science)
• Busy waiting

C

• Commitment ordering
• Compare-and-swap
• Conservative two-phase locking
• Construction and Analysis of Distributed Processes
• Critical section

D

• Database transaction schedule
• Distributed concurrency control
• Double compare-and-swap
• Double-checked locking

E

• E-LOTOS
• Ease (programming language)
• Event (synchronization primitive)

F

• Fetch-and-add
• Funnel (concurrent computing)
• Futex

G

• Giant lock
• Global interpreter lock
• Global serializability

I

• Index locking

L

• Language of Temporal Ordering Specification
• Lease (computer science)
• Linearizability
• Load-link/store-conditional
• Lock (computer science)
• Lock convoy
• Locks with ordered sharing

M

• Modular concurrency control
• Modular serializability
• Monitor (synchronization)
• Multiple granularity locking
• Multiversion concurrency control
• Mutual exclusion

N

• Non-blocking algorithm
• Non-lock concurrency control

O

• Operational transformation
• Optimistic concurrency control
• Overlapped I/O

P

• Path expression
• Priority ceiling protocol
• Priority inheritance
• Priority inversion

R

• Read-copy-update
• Read–modify–write
• Readers–writer lock
• Record locking
• Reentrant mutex
• Regular semantics
• Room synchronization

S

• Safe semantics
• Semaphore (programming)
• Seqlock
• Serializing tokens
• Snapshot isolation
• Software lockout
• Software transactional memory
• Speculative multithreading
• Squatting attack
• Strong strict two-phase locking

T

• Test and test-and-set
• Test-and-set
• Thundering herd problem
• Timestamp-based concurrency control
• Timestamping (computing)
• Transactional memory
• Transactional Synchronization Extensions
• Two-phase locking

V

• Volatile (computer programming)

W

• Wait-for graph