Edge-chasing algorithm is the implementation of Chandy-Misra-Haas’s algorithm for AND request model and it is useful in detecting deadlock in a distributed Systems.This algorithm makes use of a unique message on every occasion, impasse detection is initiated by process Pi and it’s triplet being sent by means of site of process Pi to site of process Pk.
To run the classes in the project,DAJ toolikit will be required.
Download the Toolkit for JDK 6.0 : https://www3.risc.jku.at/software/daj/
Read the pdf : https://github.com/motib/daj/tree/master/docs
We have simulated the Edge Chasing Algorithm for deadlock detection using Java and DAJ toolkit. DAJ toolkit is a tool for designing, implementing, simulating, and visualizing distributed algorithms. We have implemented the algorithm using 5 classes in Java:
This is the main class that has the java main function in it and it is also responsible for creating the network and running the simulation.
This class contains the implementation of Edge Chasing algorithm. Each node in the network runs this algorithm.
This class gives the format of probe messages which are transmitted. It contains three attributes, initiator, sender and receiver.
This class is used to detect the deadlock at any point of time. It extends the GlobalAssertion class provided by DAJ toolkit.
Unit tests are added in this class for testing of NodeProgram class.
Vishal John Varghese : https://github.com/VishalJohnVarghese1996