"An algorithm to recover from the Deadlock. Single Instance of Each Resource Type : If all resources have only a single instance, then we can define a Deadlock Detection Algorithm that uses a variant of the Resource-Allocation Graph, called a Wait-For Graph. We obtain this graph from the Resource-Allocation Graph by removing the nodes of type resource and collapsing the appropriate edges. Source: http://in.docsity.com/en-docs/Fundamentals_of_Operating_Systems__Lecture_notes__Poonam_Sharma"
Add a comment
to see other 5 answers