Deadlock and Starvation

Deadlock and Starvation

Deadlock - two or more processes are waiting indefinitely for an event that can be caused by only one of the waiting processes.
Let S and Q be two semaphores initialized to 1

P₀
wait(S);
wait(Q);
.
.
.
signal(S);
signal(Q);

P₁
wait(Q);
wait(S);
.
.
.
signal(Q);
signal(S);
Starvation - indefinite blocking. A process may never be removed from the semaphore queue in which it is suspended.

You are here: 85349 -> Resources -> Lectures -> 6 -> 25	Search \| Site Map
[ Questions or Comments ] Lecture 6: Slide 25 of 61