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)

Average waiting time, Customer arrivals at a gas station can be characteriz...

Customer arrivals at a gas station can be characterized by exponential distribution with mean of 10 minutes. The amount of time they take to pump gas can be characterized by an ex

What are the different sections of a report, What are the different section...

What are the different sections of a report? A report is categorized into many sections: The Report header: In this you place a control which must appear only at the startin

Rational schema, write the rational schema and draw it’s dependency diagram...

write the rational schema and draw it’s dependency diagram. Identify all dependencies.

How do you control instructions like branch, How do you control instruction...

How do you control instructions like branch, cause problems in a pipelined processor? Pipelined processor gives the best throughput for sequenced line instruction. In branch in

Could tcp allow ip to checksum the data, Could TCP allow IP to checksum the...

Could TCP allow IP to checksum the data? TCP cannot permit IP to checksum data yet IP has its own checksum for its header. IP layer is fundamentally responsible for routing of

Executing a parallel algorithm, Q. Executing a parallel algorithm? Mult...

Q. Executing a parallel algorithm? Multiple processors need synchronization with one another when executing a parallel algorithm. So task which is running on processor X may ha

Explain the probability of availability of free lines, How does one arrive ...

How does one arrive at the probability of availability of free lines during the busy hour? One can arrive at the possibility of free lines throughout busy hour using the delay

Explain virtual address, What is virtual address? The binary address th...

What is virtual address? The binary address that the processor used for either instruction or data known as virtual address.

Name of current gui status is there, In which system field does the name of...

In which system field does the name of current gui status is there? The name of the present GUI STATUS is available in the system field SY-PFKEY.

Discussion., Functionality first and then Security?

Functionality first and then Security?

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