|
Edge-chasing is an algorithm for deadlock detection in distributed systems.
Whenever a process A is supposed to be blocked for some resource, a probe message is sent to all processes it may depend on. The probe message stores the id of the process blocked, A, and the path that the message is following through the distributed system.
If a process receives the probe it may discard it, if it is not blocked, or forward it to all the process it depends on.
So if sooner or later the probe returns to process A, there is a circular wait, and the deadlock is confirmed.
|
