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)

Is dos a real time os, DOS is not a RTOS (real time Operating system), thou...

DOS is not a RTOS (real time Operating system), though MS DOS can be used with certain APIs to attain the RTOS functionality. For example, the RT Kernel (Real Time Kernel) which ca

Software engineering, What are coupling and cohesion and why are they impor...

What are coupling and cohesion and why are they important concepts in software design?

Discuss different mode of centralized stored program control, Explain SPC. ...

Explain SPC. Also discuss the different modes of Centralized SPC In stored program control systems, set of instructions or a program to the computer is stored into its memory a

Capacity and access speed of hard disk, Capacity and access speed: PC ...

Capacity and access speed: PC hard disk drive capacity (measured in GB). The vertical axis is logarithmic, so the accurate line corresponds to exponential growth.  By using

Implementation of a simple arithmetic, Q. Implementation of a Simple Arithm...

Q. Implementation of a Simple Arithmetic? So, by now we have concerned how logic and arithmetic micro-operations can be applied individually. If we combine these 2 circuits alo

Categorize the cpu scheduling algorithms, Categorize the CPU scheduling alg...

Categorize the CPU scheduling algorithms? The various CPU scheduling algorithms are categorized as given below:

Show the hypothetical instruction format of 32 bits, Q. Show the Hypothetic...

Q. Show the Hypothetical Instruction Format of 32 bits? A sample instruction format is shown in figure below. Figure: A Hypothetical Instruction Format of 32 bits

What is the difference between swapping and paging, What is the difference ...

What is the difference between Swapping and Paging? Swapping: Entire process is moved from the swap device to the major memory for implementation. Process size must be less t

Salient features of a parallel programmable interface-8255, Determine the s...

Determine the salient features of a parallel programmable interface, 8255. 24 I/O lines in 3 8-bit port groups - A, B, C A, B can be 8-bit input or output ports C

Write a verilog code to swap contents of two registers, Write  a  verilog  ...

Write  a  verilog  code  to  swap  contents  of  two registers  with  and without  a  temporary register? With temp reg : always @ (posedge clock) begin temp=b; b

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