chapter 6 synchronization

Question 1

if
Two or more processes/threads manipulate a shared resource
concurrently, and
The outcome of the execution depends on the particular order
in which the access takes place

Answer 1

it it is called racecondition

Question 2

____________ is needed to prevent race conditions from happening

Answer 2

Synchronization

Question 3

To avoid race conditions, the execution of critical section must be

Answer 3

mutually exclusive

Question 4

The _____________ is to design a protocol with which processes can use to cooperate and ensure mutual exclusion

Answer 4

critical-section problem

Question 5

A __________ is a section of code in which a process accesses shared resources

Answer 5

critical section (CS)

Question 6

A critical section protocol consists of two parts

Answer 6

entry section
exit section

Question 7

A good solution to the critical section problem must satisfy the following three conditions

Answer 7

Mutual Exclusion
Progress
Bounded Waiting

Question 8

If a process P is executing in its critical section, no other processes can be executing in their corresponding critical sections

Answer 8

this condition is called mutual exclusion

Question 9

If a process P is executing in its critical section, no other processes can be executing in their corresponding critical sections (it should not block other process from accessing the cs).

Answer 9

Progress

Question 10

After a process made a request to enter its critical section and before it is granted the permission to enter, there exists a bound on the number of turns that other processes are allowed to enter

Answer 10

bounded waiting

Question 11

________ – allows preemption of the process when running in kernel mode

Answer 11

Preemptive

Question 12

__________ – runs until exits kernel mode, blocks, or voluntarily yields CPU

Answer 12

Non-preemptive