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

How does dma raise system concurrency, Q. How does DMA raise system concurr...

Q. How does DMA raise system concurrency? How does it make difficult hardware design? Answer: DMA increases system concurrency by allowing the CPU to perform tasks while the

What is mutual exclusion, Question 1 Brief the following distributed compu...

Question 1 Brief the following distributed computing system model Question 2 Explain the components involved in implementation of RPC mechanism Question 3 What is

Scheduler that select process from secondary storage device, A scheduler th...

A scheduler that selects processes from secondary storage device is known as Medium term scheduler is a scheduler that selects processes from secondary stor

S.f.and b.m, What is area moment

What is area moment

Explain fifo page replacement, Explain FIFO page replacement A FIFO rep...

Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p

Reference counting, The idea of reference counting is to maintain, for ever...

The idea of reference counting is to maintain, for every object, the total number of references to that object, i.e. the number of "incoming" pointers. Whenever the number of refer

Thread, advantages and disadvantages of kernal level thread

advantages and disadvantages of kernal level thread

10 marks, Differentiate between sequential access and direct access method?...

Differentiate between sequential access and direct access method?

Basic server model, Suppose we want to program a Web server; we could easil...

Suppose we want to program a Web server; we could easily do so without using concurrency, as follows: while(true) wait connection read from socket and parse url look up url cont

Segmentation, explain simple segmentation

explain simple segmentation

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages