answersLogoWhite

0


Best Answer

The graph is the the actual picture that shows the resource allocation; the algorithm is the method used to produce that graph.

User Avatar

Wiki User

14y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is difference between resource allocation graph and resource allocation graph algorithm?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Difference between resource allocation and resource utilization?

Resource allocation refers to setting aside resources. Resource utilization refers to how resources are used.


What is the use of resource allocation and wait for graph and difference between both?

nijera answr thik kore dao na...


What is the difference between allocation and search data structure?

difference between serch data structure and allocation data structure


What is the difference between resource allocation graph and wait for graph?

In Wait for Graph the request edge is a directed edge Pi → Pj which indicates that process Pj is holding a resource that process Pi needs and thus Pi is waiting for Pj to release its lock on that resource. It does not have any allocation edge.In case of Resource Allocation Graph the request edge is a directed edge Pi → Rj which indicates that process Pi is requesting resource Rj. It has an allocation edge from Rj→Pk when the resource Rj is allocated to process Pk.The way the graphs are drawn are also different but both of them are used in deadlock detection.


What is the difference between resource smoothing and resource leveling?

there is no difference


What is the difference between AES Rijndael symmetric algorithm encryption and a hash algorithm?

678


What is difference between lemma and algorithm?

A Method that used to be a comouter to soultion of promlems is called algorithm.


What is the difference between a real resource and a virtual resource?

a


What is the difference between an algorithm and a computer program?


What is the difference between procedure and algorithm?

A procedure can go on forever.Where as an Algorithm, will eventually terminate and will have each step precisely defined.


Difference between greedy algorithm and dynamic programming?

the basic difference between them is that in greedy algorithm only one decision sequence is ever generated. where as in dynamic programming many decision sequences are generated.


Difference between Bresenham and midpoint circle drawing algorithm?

what is difference between mid-point and bresenhams circle algorithm what is difference between mid-point and bresenhams circle algorithm bresenhams circle algorithm results in a much more smoother circle,comparred to midpoint circle algorithm..In mid point,decision parameter depends on previous decision parameter and corresponding pixels whereas in bresenham decision parameter only depends on previous decision parameter...