Deadlock Detection

Deadlock detection and recovery occurs after system into deadlock situation. Resource allocation graph (RAG) is used as deadlock detection algorithm.

  • For single instance type resources when a cycle exists in the resource allocation graph then deadlock situation occurred otherwise no deadlock.

  • For multiple instances type resources when a cycle exists in the resource allocation graph then deadlock may occurred, then Banker's algorithm to check that deadlock is occurred or not. If there is no cycle exists in the resources allocation graph (RAG), then is no deadlock in the system.

  • If all the resource are of single instance type then the cycle in the RAG is necessary and sufficient  condition for occuring a deadlock 

  • If the resource are of not single instance type then cycle in RAG is just a necessary condition but not a sufficient condition for occuring of deadlock 

Contributor's Info

Created: Edited:
0Comment