# Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 34 (Page No. 468)

111 views
Explain the differences between deadlock, livelock, and starvation.
0
can anyone elaborate livelock

ln this, a group of the member is waiting for the other member to release its lock, hence ceasing each other from accessing the resource.

Livelock is a particular case of starvation.

It is different from deadlock because all the processes are in the state of waiting.

When some process is never serviced, even when it's not in deadlock, then this situation is called starvation.

edited by

## Related questions

1
54 views
Main memory units are preempted in swapping and virtual memory systems. The processor is preempted in time-sharing environments. Do you think that these preemption methods were developed to handle resource deadlock or for other purposes? How high is their overhead?
Two processes, $A$ and $B,$ each need three records, $1, 2,$ and $3,$ in a database. If $A$ asks for them in the order $1, 2, 3,$ and $B$ asks for them in the same order, deadlock is not possible. However, if $B$ asks for them ... resources, there are $3!$ or six possible combinations in which each process can request them. What fraction of all the combinations is guaranteed to be deadlock free?