Deadlocks can be described by which graph - Resource-Allocation Graph

Discussion

• Divya   -Posted on 16 Jun 21
  Good
• Nirja Shah   -Posted on 25 Nov 15
  - Deadlocks use the Resource-Allocation Graphs which have the following properties:
  
  1.A set of resource categories, {R1,R2,R3,.....,RN}, which appear as square nodes on the graph. Inside the resource node dots ( . ) indicates the specific instances of the resource. (Eg. Two dots might represent two laser printers.)
  
  2.A set of processes {P1,P2,P3,....,PN}
  
  3. Request Edges - A set of directed arcs from Pi to Rj, indicates that the process Pi has requested to resource Rj, and it is currently waiting for the resources to become available.
  
  4. Assignment Edges - A set of directed arcs from Rj to Pi indicates that the resource Rj has been allocated to process Pi, and that Pi is currently holding the resource Rj.
  
  5. Note that when the request is granted, a request edge can be converted into an assignment edge by reversing the direction of the arc. ( However note also that request edges point to the category box, whereas assignment edges emanate from a particular instance dot within the box.)

➨ Post your comment / Share knowledge