Please describe the Resource-Allocation Graph Algorithm by which one can avoid the deadloc?

over 13 years ago

"Resource-Allocation Graph Algorithm : Suppose that process Pi requests resource Rj. The request can be granted only if converting the request edge Pi Rj to an assignment edge Rj Pi does not result in the formation of a cycle in the Resource- Allocation Graph. Source: http://in.docsity.com/en-docs/Fundamentals_of_Operating_Systems__Lecture_notes__Poonam_Sharma"

ekaksha

over 13 years ago

"Resourcefulness-Part Data Algorithm  State edgeP when i → Third t mentioned that will process R m whitethorn requestresource Radius n ; symbolized by the dashed occupation.  Declare advantage switches in order to petition advantage every time a procedure asks aresource.  Every time a resource will be released by a course of action, assignment edgereconverts into a maintain side.  Means have to be stated a priori from the organization."

to see other 3 answers

Please describe the Resource-Allocation Graph Algorithm by which one can avoid the deadlock situation?

5 replies

Can you explain Banker's Algorithm by which one can avoid the deadlock situation?