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)

Anu, write a program to find the area under the curve y=f(x) between x=a an...

write a program to find the area under the curve y=f(x) between x=a and y=b integrate y=f(x) between the limits of a and b. the area under a curve between two points can be found b

Explain arithmetic shift micro-operations, Q. Explain arithmetic shift Micr...

Q. Explain arithmetic shift Micro-operations? In arithmetic shift a signed binary number is shifted to right or to the left. So an arithmetic shift-left causes a number to be m

Artificial intelligence, Artificial intelligence ( AL) is a field of scien...

Artificial intelligence ( AL) is a field of science and technology based on disciplines such as computer science biology psychology linguistics mathematics and engineering. The g

What are the risks involved in electronic payment systems, What are the ris...

What are the risks involved in Electronic Payment Systems?    From the customer's perspective: Dishonest merchants or financial service providers Stolen payment

Registers - processor, These will be independent of each other and will not...

These will be independent of each other and will not affect to each other, and so they can be fed into two different implementations units and run in parallel. The ability to remov

Computer architecture, Explain division and its restoring and non-restoring...

Explain division and its restoring and non-restoring techniques?

Grid computing, Grid Computing means applying the resources of a lot of com...

Grid Computing means applying the resources of a lot of computers in a network simultaneously to a one problem for solving a scientific or a technical problem that needs a large nu

What is meant by hotspots, What is meant by hotspots? A Hotspot is a l...

What is meant by hotspots? A Hotspot is a list area where the mouse pointer appears as an upright hand symbol. When a user points to that area (and the hand cursor is active),

Write a short note on structure chart, Write a short note on structure char...

Write a short note on structure chart.    Structure Chart is an significant program design method and it shows all components of code in a hierarchical format

Handling multiple devices - computer architecture, Handling Multiple Device...

Handling Multiple Devices Interrupt Priority   Continue to accept interrupt requests from higher priority components   Disable interrupts from component at the sa

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