Common Concurrency Mechanisms

Question 1

This involves an integer value that is used for signaling processes. Only three (3) operations may be performed on a semaphore, all of which are atomic: initialize, decrement, increment.

This concurrency mechanism is also known as the general semaphore

Answer 1

Couting Semaphore

Question 2

This is a semaphore that only takes the values zero and one.

Answer 2

Binary Semaphore

Question 3

This mechanism is similar to a binary semaphore. The key difference between the two is that the process that locks the mutex must be the one to unlock it, and only the holder of the lock can operate

Answer 3

Mutual Exclusion (Mutex) Lock

Question 4

This is a data type that is used to block a process or a thread until a specific condition is true

Answer 4

Condition Variable

Question 5

This is a programming construct that encapsulates variables, access procedures, and initialization code within an abstract data type.

Answer 5

Monitor

Question 6

It is a memory word used as a synchronization mechanism

Answer 6

Event Flag

Question 7

This mechanism is considered as a means for two (2) processes to exchange information, and that may be used for process synchronization

Answer 7

Mailbox or Message Passing

Question 8

This is a mechanism in which a process executes in an infinite loop waiting for the value of a lock variable to indicate availability

Answer 8

Spinlock