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)

Ring, Ring This is a easy linear array where the end nodes are connecte...

Ring This is a easy linear array where the end nodes are connected.  It is equivalent to a engage with wrap around connections. The data transmit in a ring is normally one dire

Serialized when you perform serialization, What exactly is being serialized...

What exactly is being serialized when you perform serialization? Serialization is the process of changing an object into stream of bytes. We perform it at the time of transpor

Network properties, Network Properties There are many properties are as...

Network Properties There are many properties are associated with interconnection networks:- 1) Topology: It signify how the nodes a network are organised. A variety of top

Determine the bandwidth requirement of a telephone channel, The bandwidth r...

The bandwidth requirement of a telephone channel is (A)  3 KHz                                      (B)  15 KHz (C)  5 KHz                                      (D)  25 KH

Design combinational-sequential electronic logic gate, Combinational/Sequen...

Combinational/Sequential Logic design with Integrated Circuits (Dual in line package) Car wash concept with the following steps in a Combinational Logic Diagram: 1.    Start

Explain ones complement operator, One's Complement Operator: ~ The one'...

One's Complement Operator: ~ The one's complement operator, sometimes called the "bitwise complement" or "bitwise NOT" operator, produces the bitwise one's complement of its op

Register-to-register operands in RISC, Q. Register-to-register operands in ...

Q. Register-to-register operands in RISC? Register-to-register operands: In RISC machines operation which access memories are LOAD and STORE. All other operands are kept in reg

Describe thead, Q. Describe THEAD, TBODY and TFOOT tag? THEAD, TBODY, ...

Q. Describe THEAD, TBODY and TFOOT tag? THEAD, TBODY, TFOOT , , and form groups of rows. specifies that a group of rows are heade

By using what nested macro calls are expanded, Nested Macro calls are expan...

Nested Macro calls are expanded using the? Ans. By using the LIFO (Last in First out) Nested Macro calls are expanded.

Why are high-speed memories required, Q. Why are high-speed memories requir...

Q. Why are high-speed memories required? Is the main memory not a high-speed memory? The answer to second question is absolutely 'No' though why so? Then if memories are slowe

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