Algorithm Concurrency - Control Problems

Question 1

Atomic Operation

Answer 1

A function or action implemented as a sequence of one or more instructions that appears to be indivisible.

No other process can see an intermediate state or interrupt the operation

The sequence of instructions is guaranteed to execute as group or no execute at all.

Question 2

Critical Section

Answer 2

A section of code within a process that requires access to shared resources that must not be executed while another process is in a corresponding section of code.

Question 3

A deadlock

Answer 3

A situation in which two or more processes are unable to proceed because each is waiting for one or the others to do something

Question 4

Livelock

Answer 4

A situation in which two ore more processes continuously change their states in response to changes in the other process(es) without doing any useful work.

Question 5

Mutual Exclusion

Answer 5

The requirement that when one process is in a critical section that accesses shared resources, no other process may be in a critical section that accesses any of those shared resources.

Question 6

Race condition

Answer 6

A situation in which multiple threads or processes read and write a shared data item and the final result depends on the relative timing of their execution

Question 7

Starvation

Answer 7

A situation in which a runnable process is overlooked indefinitely by the scheduler, although it is able to proceed, it is never chosen.