The difficulty is that each site must maintain its own local wait-for graph.However,the lack of a cycle in a local graph does not ensure *** from deadlock.Instead,we can only ensure the system is not deadlocked if the union of all local wait-for graphsis acyclic.
The difficulty is that each site must maintain its own local wait-for graph.However,the lack of a cycle in a local graph does not ensure *** from deadlock.Instead,we can only ensure the system is not deadlocked if the union of all local wait-for graphsis acyclic.