Skip to content

We detect if there is a deadlock or not in a resource allocation graph using topological sorting algorithm

Notifications You must be signed in to change notification settings

ANIRUDH-333/Deadlock-detection-using-topological-sorting

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Deadlock-detection-using-topological-sorting

We detect if there is a deadlock or not in a resource allocation graph using topological sorting algorithm

Description of files

  1. Topological sorting.ipynb - Code for Deadlock detection using Topological Sorting
  2. Report.pdf - Report
  3. {i}.jpeg (i = i:6) - Supporting images for Resource allocation Graphs used in code for demonstration

Authors

  1. Aadharsh Aadhithya
  2. Anirudh Edpuganti
  3. Onteddu Chaitanya Reddy
  4. Pillalamarri Akshaya

About

We detect if there is a deadlock or not in a resource allocation graph using topological sorting algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published