Ho-Ramamorthy Algorithm in Distributed System : Deadlock Detection : How to find Deadlock ?

In this lecture you will learn the concept of Ho-Ramamorthy Algorithm in Distributed System in easy way.
What is Deadlock and How to find Deadlock in Distributed System ?
Total Centralized Control Method in Deadlock :
The Ho-Ramamoorthy Algorithms: Two phase Model (can be for AND or OR model).
In this, each site has a Status Table of locked and waited resources.
The control site will periodically ask for this table from each node.
The control node will search for cycles and, if found, will request the table again from each node.
Only common information in both reports will be analyzed for confirmation of a cycle.

The Ho-Ramamoorthy Algorithm:
One Phase Model (can be for AND or OR model)

In this, each site keeps 2 tables for all local process :
‘ Process status’ and ‘Resource status’ table.
The control site will periodically ask for these tables (via message) from each node.
The control site will build and analyze the WFG, looking for cycles and resolving them when found