Deadlocks project

In this project you will develop a deadlock detection algorithm to determine whether a given system state, s, which is represented by a General Resource Graph, G(V,E), contains a se t of processes that are deadlocked. The system is continuously keeping track of all the resource requests issued by processes and corresponding resource allocations. The state of the system is maintained by a set of edges, E = {(p i , r k ), (r l , p j )}, which represents all requests and allocati on in system state s. You may assume that the system contains only reusable resources . The input to your algorithm may be an adjacency matrix or an edge list representing the set E of system state s. The output of your algorithm is the list of processes that are deadlocked in state s. Your algorithm will have to execute on any syntactically correct input. Deliverables: 1. A program that implements your deadlock detection algorithm. 2. At least three examples of executing the algorithm on three different General Resource Graphs 3. A short report (2 -3 pages) describing the algorithm and a discussion of potential improvements that could lead to a more efficient deadlock detection.