Path Pushing Algorithm : Edge-Chasing Algorithm in Distributed System : Transaction in Distributed

In this lecture you will understand and learn the concept of Path-Pushing Algorithm and Edge-Chasing Algorithm in Distributed System. How this algorithm work and what are the significance of this algorithm ?

Path Pushing Algorithm :In this, Path information sent from waiting node to blocking node
This approach deals with the Transactions.
Each transaction may have sub transactions but they executes in sequentially manner.
In this all the Transactions are totally ordered or sequentially.
Path information sent from waiting node to blocking node.
In this, WFG constructed by disseminating dependency sequences :
Each node builds a WFG based on local info & info from other sites.
Detect and resolves local deadlocks.
Transmits to other sites deadlock info in form of waiting path.

Edge-Chasing Algorithm :

In this, messages are sent along graph edges.
Special messages (probes) sent along edges of WFG to detect a cycle.
When blocked process receives message, resends it on its outgoing edges of WFG.
When a process receives a message it initiated, declares deadlock.
process sends special message.
A blocked process receive message and circulates it along its outgoing dependency edges.

for more video , subscribe the channel : Computer science academy by Dinesh Sir