0
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.
Add your answer:
Earn +20 pts
What is Difference between tree and spanning tree?
A tree is a connected graph in which only 1 path exist between any two vertices of the graph i.e. if the graph has no cycles. A spanning tree of a connected graph G is a tree which includes all the vertices of the graph G.There can be more than one spanning tree for a connected graph G.
Difference between a directed graph and an undirected graph in a computer program?
In an undirected graph, an edge is an unordered pair of vertices. In a directed graph, an edge is an ordered pair of vertices. The ordering of the vertices implies a direction to the edge, that is that it is traversable in one direction only.
How does compiler do register allocation?
Through liveness analysis, compilers can determine which sets of variables are live at the same time, as well as variables which are involved in move instructions. Using this information, the compiler can construct a graph such that every vertex represents a unique variable in the program. Interference edges connect pairs of vertices which are live at the same time, and preference edges connect pairs of vertices which are involved in move instructions. Register allocation can then be reduced to the problem of K-coloring the resulting graph, where K is the number of registers available on the target architecture. No two vertices sharing an interference edge may be assigned the same color, and vertices sharing a preference edge should be assigned the same color if possible. Some of the vertices may be precolored to begin with, representing variables which must be kept in certain registers due to calling conventions or communication between modules. As graph coloring in general is NP-complete, so is register allocation. However, good algorithms exist which balance performance with quality of compiled code.
What is the difference between tree search and graph search?
A graph is a set of vertices which are connected to each other via a set of edges. A tree is a special type of hierarchical graph in which each node may have exactly one "parent" node and any number of "child" nodes, where a parent node is one level closer to the root and a child node is one level further away from the root.
What is the difference between hard and tough?
In a stress-strain graph, hard materials have the steepest graph, owing to having the highest young modulus. This is because Hard materials resist a deformation, wether elastic or plastic. So initially the steepest graph in a stress-strain graph is the strongest.Tough materials withstand force, but they do not resist the deformation. The special thing in tough materials is that they can take in a lot of elastic potential energy. In a stress-strain graph, a Tough material has the highest area under curve.A material can be tough without having being hard. A material that is hard is not necessarily tough.
What is difference between resource allocation graph and resource allocation graph algorithm?
The graph is the the actual picture that shows the resource allocation; the algorithm is the method used to produce that graph.
What is the use of resource allocation and wait for graph and difference between both?
nijera answr thik kore dao na...
Can resource allocation graph have cycles without a deadlock?
yes resource allocation graph have cycles without a deadlock existing.
Wait for graph and resource allocation graph in deadlocks?
yes,wait for graph=WFG,crazy wait!
What are the main limitations to the resource allocation graph used in deadlock detection. explain?
time Stamp
What is instances of a resource in Resource Allocation Graph?
an instance of a resource is the no. of resources of a particular resource type are available. For eg: If we say we have 5 instances of a resource printer,it simply means that there are five printers available for use.
What is the difference between a line graph and pie graph?
no
What is the difference between a diagram and a graph?
The difference between a graph and a diagram is as follows: a diagram is a chart which shows a drawing and a graph is a graph with lines or bars indicating something specific in numbers.
What is the difference between a constant in a graph and a constant in a experiment?
the difference between a constant in a graph and a constant in a experiment is that when on a graph, the constant is the thing that changes, and in a experiment it is the part that stays the same.
What is the difference between the information of a bar graph and a line graph?
a line graph is over time. a bar graph is not
What is the difference between a double bar graph and a bar graph?
The difference between a bar graph and a double bar graph is...... A bar graph displays one set of data, and a double bar graph compares two different sets of information/data.So should have a key.
What is the difference between a pie graph and a bar graph?
a pie graph shows percentages and a bar graph shows numbers and amounts
