Consider the centralized and t

The centralized algorithm for dead lock detection requires individual processors or sites to report its local waits-for graph to a centralized manager.The edges in the waits-for graph are combined and a  cycle detection algorithm is performed in the centralized manager.Thecost of this algorithm is the cost of communicating the various waits-for graph to the centralized server.In the distributed approach,cach site builds its own local waits-for graph and predicts whether there is a possibility of a cycle based on local observations,If indeed there is a possibility of a cycle,a message is sent along the various sites that might constitute a cyclic dependency.Multiple sites that are potentially involved in the cyclic dependency could initiate this operation simultaneously.Therefore,the distributed algorithm is sometimes better than the centralized algorithm and is sometimes worse than the centralized algorithm in terms of message complexity.It is better than the centralized algorithm since it does not communicate the entire local waits-for graph to the centralized server.(Also note that that there could be performance bottlenecks due to the use of the centralized server in the centralized algorithm.) However,the distributed algorithm could incur more messages when multiple sites are simultaneously exploring the existence of a cyclic dependency.