29-03-2017, 03:28 PM
In computer science, edge chasing is an algorithm for deadlock detection in distributed systems. Developed by Chandy Mishra Hass. Each time a process A is blocked for some resource, a polling message is sent to all processes that A may depend on. The polling message contains the process id of A along with the path that the message has followed through the distributed system. If a blocked process receives the probe, it will update the path information and send the probe to all the processes on which it depends. Non-blocked processes may discard the probe.
If the probe eventually returns to process A, there is a loopback loop of blocked processes, and a blockage is detected. Efficient detection of such cycles in the "standby chart" of blocked processes is a major implementation problem.
If the probe eventually returns to process A, there is a loopback loop of blocked processes, and a blockage is detected. Efficient detection of such cycles in the "standby chart" of blocked processes is a major implementation problem.
