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)

Accessing a cache - computer architecture, Accessing a Cache:  Direct ...

Accessing a Cache:  Direct mapping: (Block address) modulo (Number of cache block in the cache) The valid bit indicate whether an entry contain a valid address.

Difference among the static rams and dynamic ram, Difference among the Stat...

Difference among the Static rams and dynamic rams. Static RAM: It is costly as each bit of memory will take around 6 CMOS transistors. More speedy as transistors are us

Describe about relationships and look up fields, Relationships are imported...

Relationships are imported from the source to finish without any hindrance but once they land in the destination they can never be changed or changed and change of extensions canno

Explain multithreading in a programming language, Multithreading is the pro...

Multithreading is the process in which more than single thread run independent of each other within the process in any programming language such as C, C++, etc.

Engineering applications, Engineering Applications A few of the enginee...

Engineering Applications A few of the engineering applications are: Airflow circulation over aircraft machinery, Simulations of simulated ecosystems. Airflow c

Draw the logic diagram of 4-bit odd parity checkers, Normal 0 f...

Normal 0 false false false EN-IN X-NONE X-NONE

C program, program to find minimum total number of shelfs

program to find minimum total number of shelfs

Explain about asynchronous message passing, Q. Explain about Asynchronous m...

Q. Explain about Asynchronous message passing? In Asynchronous message passing message transmitting and receiving aren't synchronized in space and time. The store and forward

Obstacles to is implementation - information system, Obstacles to IS implem...

Obstacles to IS implementation While information systems are now becoming the norm in most organisations the journey to this point has been a difficult one. Even in the 21st c

Describe the von neumann architecture, Describe the VON NEUMANN ARCHITECTUR...

Describe the VON NEUMANN ARCHITECTURE Most  of  present  computer  designs  are  based  on  idea  developed  by  John  vonNeumann referred to as the VON NEUMANN ARCHITECTURE. V

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