0
In computer science, edge-chasing is an algorithm for deadlock detection in distributed systems.
Whenever a process A is blocked for some resource, a probe message is sent to all processes A may depend on. The probe 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 forward the probe to all the processes it depends on. Non-blocked processes may discard the probe.
If eventually the probe returns to process A, there is a circular waiting loop of blocked processes, and a deadlock is detected. Efficiently detecting such cycles in the "wait-for graph" of blocked processes is an important implementation problem.
Still curious? Ask our experts.
Chat with our AI personalities
Maxine
Vivi
SteveAdd your answer:
Earn +20 pts
What is the difference between aluminum extruded bar and aluminum bar?
The extruded bar would be produced by pushing molten aluminum through a die. Where as the other option for making the bar would be to cast it in a mould. The extruded bar would probably have smoother sides and would be available in longer lengths.
What is the difference between potential difference and current?
think of potential as pressure and current as flow. you can have pressure in a water hose with out flow. open the valve and current happens. The difference in potential divided by the impedance is equal the current.
What does an engineer call a pushing force?
kinetic energy?
What type of mechanical wave is produced by pushing sharply on the end of a spring toy?
Buoyancy
How much water can go through a 1inch pipe?
depends on the pressure pushing through the pipe
