Concurrency - Mutual Exclusion

Data System Architecture

Concurrency - Mutual Exclusion


Mutual Exclusion means that two threads or process cannot at the same time access the same resource (ie method, class, file, …) in order to prevent race conditions.

A lock (also known as mutex) is a mutual exclusion mechanism that provide exclusive access to internal data structures.

Documentation / Reference

Recommended Pages
Data System Architecture
Concurrency - Latches (System Lock)

Latches are like semaphores. Latches are used to guarantee physical consistency of data, while locks are used to assure logical consistency of data. Latches are simple, low-level system lock (serialization...
Data System Architecture
Concurrency - Lock (Mutex)

A lock is a synchronizationmechanism designed to enforce a mutual exclusion of threads. A lock is also known as a mutex. Type: binary semaphore - yes / no Most locking designs block the execution...
Data System Architecture
Concurrency - Mutex (Mutual exclusion object)

A mutex is a mutual exclusion object that restricts access to a shared resource (e.g. a file) to a single thread instance. The mutual exclusion synchronization between concurrent thread means that: ...
Data System Architecture
Parallel Programming - (Function|Operation)

A function or an operator has to be: commutative and associative in order to be computed correctly in parallel. A properly constructed operation is inherently parallelism, so long as the function(s)...
Process States
Process - Shared State (Shared Data)

Shared state between processes Operations upon shared states are critical sectioncritical sections that must be mutually exclusive. Failure to obey this rule opens up the possibility of corrupting the...

Share this page:
Follow us:
Task Runner