Explain resource allocation graph, Operating System

Assignment Help:

RESOURCE ALLOCATION GRAPH

When a process Pi wishes an instance of resource type Rj, a request edge is inserted in the resource allocation graph. When this request is able to be fulfilled, the request edge is immediately transformed to an assignment edge. When the process no longer requires access to the resource, it liberate the resource as a result the assignment edge is deleted.

Process states:

  • Process p1 is embrace an instance of r2 and is waiting for an instance of r1.
  • Process p2 is embrace an instance of r1 and an instance of r2 and is waiting for an instance of r3.
  • Process p3 is embracing an instance of r3.

If there is a cycle in the reallocation graph then there is deadlock, else no.

 

 


Related Discussions:- Explain resource allocation graph

What is busy waiting, What is busy waiting? The repeated implementation...

What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti

Define the client - server communications environment, Define the Client - ...

Define the Client - Server Communications Environment Today's client - server communications environment offers programmers great flexibility for application design. Applicatio

Information system, using the transformation process model and system think...

using the transformation process model and system thinking concepts explain the key operation of TGL works.

Define lru page replacement policy, Define ‘LRU’ page replacement policy ...

Define ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.

Differences between foreground and background, Describe the differences bet...

Describe the differences between foreground and background processing. What advantage does background processing provide? 1. Background processes typically run with little or no

Dynamically loadable kernel modules, Q. Dynamically loadable kernel module...

Q. Dynamically loadable kernel modules give elasticity when drivers are added to a system however do they have disadvantages too? Under what situations would a kernel be compiled

Sector sparing, What is sector sparing is proper definition

What is sector sparing is proper definition

What are the use of job queue, What are the use of job queues, ready queues...

What are the use of job queues, ready queues and device queues? As a process enters a system they are put in to a job queue. These queues having of all jobs in the system. The

Define properties of distributed operating system, Define properties of Dis...

Define properties of Distributed operating system Distributed:- This system distributes computation among several physical processors. The processors do not share memory or a

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd