Explain resource request and allocation graph (rrag), Computer Engineering

Assignment Help:

Explain Resource request and allocation graph (RRAG)

Deadlocks can be explained by a directed bipartite graph known as a Resource-Request-Allocation graph (RRAG).A graph G = (V,E) is known as bipartite if V can be decomposed into two disjoint sets V1 and V2 such that every edge in E joins a vertex in V1 to a vertex in V2. Suppose V1 be a set of processes and V2 be a set of resources. As the graph is directed we will consider:

a) An edge (Rj,Pi) that is an assignment edge to mean that resource Rj has been allocated to process Pi

b) An edge (Pi,Rj) that is called a request edge to mean that process Pi has requested resource Rj

949_Resource request and allocation graph.png


Related Discussions:- Explain resource request and allocation graph (rrag)

What do you understand by electronic funds transfer, What do you understand...

What do you understand by Electronic Funds Transfer?  Electronic Funds Transfer: It's an electronic payment method that transfers the money value from one bank account to

Convert, haw to convert context free grammar to regular grammar

haw to convert context free grammar to regular grammar

Describe about the digital cameras, Describe about the Digital cameras ...

Describe about the Digital cameras The microprocessor would be used to control the below functions, for instance: - shutter speed - lens focus - Flash - Aperture (l

What is pli, What is PLI Programming  Language  Interface  (PLI)  of  V...

What is PLI Programming  Language  Interface  (PLI)  of  Verilog  HDL  is  a  mechanism  to  interface  Verilog programs  with  programs  written  in  C  language.  It also pro

Explain about microprocessors, Q. Explain about Microprocessors? Microp...

Q. Explain about Microprocessors? Microprocessors have instruction sets ranging from 20 to several hundred instructions, known as microprograms, which are stored in ROM to init

Storing a word in memory - computer architecture, Storing a word in Memory:...

Storing a word in Memory: That is similar process with fetching a word from memory. The required address is loaded into the MAR After that data to be written are lo

What is unordered lists, Q. What is Unordered Lists? First, we will bui...

Q. What is Unordered Lists? First, we will build an unordered list. Many times, these lists are also termed as bulleted lists. These lists are characterized by list items which

Explain sequential sharing, Explain Sequential sharing. Sequential s...

Explain Sequential sharing. Sequential sharing: In this technique of sharing, a file can be shared through only one program at a time, it is file accesses by P1 and P2 are

What are the features of prom, What are the features of PROM? They are ...

What are the features of PROM? They are programmed directly by the user. Faster Less expensive More Flexible

Define memory allocation scheme in ''external'' fragmentation, The memory a...

The memory allocation scheme subject to “external” fragmentation is? Segmentation is the memory allocation scheme subject to “external” fragmentation.

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