Operating System Tutorial

What is Operating System Evolution of Operating System Types of Operating System Functions of Operating System What is Kernel and Types of Kernel Operating System Properties Operating System Services Components of Operating System Needs of the Operating System Linux Operating System Unix Operating System Ubuntu Operating System What is DOS Operating System Difference Between Multi-programming and Multitasking What is Thread and Types of Thread Process Management Process State What is Process Scheduler and Process Queue What is Context Switching What is CPU Scheduling Scheduling Algorithm FCFS (First-come-First-Serve) Scheduling SJF (Shortest Job First) Scheduling Round-Robin CPU Scheduling Priority Based Scheduling HRRN (Highest Response Ratio Next) Scheduling Process Synchronization Lock Variable Mechanism TSL Mechanism Turn Variable Mechanism Interested Variable Mechanism What is Producer-Consumer Problem What is Semaphore in Operating System Monitors in Operating System What is Deadlock Deadlock Avoidance Strategies for Handling Deadlock Deadlock Prevention Deadlock Detection and Recovery Resource Allocation Graph Banker’s Algorithm in Operating System Fixed Partitioning and Dynamic Partitioning Partitioning Algorithms What is Paging and Segmentation What is Demand Paging What is Virtual Memory Disk Scheduling Algorithms FCFS and SSTF Disk Scheduling Algorithm SCAN and C-SCAN Disk Scheduling Algorithm Look and C-Look Disk Scheduling Algorithm File in Operating System File Access Methods in Operating System File Allocation Method Directory Structure in Operating System Difference between C-LOOK and C-SCAN Difference between Rotational Latency and Disk Assess Time Trap vs Interrupt How to implement Monitors using Semaphores N-Step-SCAN Disk Scheduling Why is it critical for the Scheduler to distinguish between I/O-bound and CPU-bound programs Difference between C-SCAN and SSTF Difference between SCAN and FCFS Difference between Seek Time and Disk Access Time Difference between SSTF and LOOK

Resource Allocation Graph in Operating System

Resource Allocation Graph in OS

We use the resource allocation graph for the pictographic representation of the state of a system. The resource allocation graph contains all the information related to the processes that are holding some resources and also waiting for some more resources.

Resource allocation graph consists of all the information which is related to all the instances of the resources means the information about available resources and the resources which the process is being using.

In the Resource Allocation Graph, we use a circle to represent the process and rectangle to represent the resource.

Components of RAG (Resource Allocation Graph)

There are two components of the resource allocation graph:

  1. Vertices
  2. Edges
  1. Vertices: - In the resource allocation graph, we use two kinds of vertices:
Resource Allocation Graph
  • Process Vertices
  • Resource Vertices

Process Vertices: - To represent a process, we use process vertices. We draw the process vertices by using a circle, and inside the circle, we mention the name of the process.

Resource Vertices: - To represent a resource, we use resource vertices. We draw the resource vertices by using a rectangle, and we use dots inside the circle to mention the number of instances of that resource.

According to the number of instances that may exist in the system, there are two types of resource vertices, i.e., single instance and multiple instances.

 Single instance resource type: - In single instance resource type, we use only a single dot inside the box. The single dot indicates that there is one instance of the resource.

Multiple instance resource type: - In multiple instance resource type, we use multiple dots inside the box. Multiple dots indicate that there are various instances of the resources.

2. Edges: - There are two types of edges we use in the resource allocation graph:

Resource Allocation Graph
  • Assign Edges
  • Request Edges

Assign Edges: - We use an assign edge to represent the allocation of resources to the process. We draw assign edges with the help of arrow in which the arrow head points the process, and the process tail points the instance of the resource.

Request Edges: - We use request edge to signify the waiting state of the process. Just like in assign edge, an arrow is used to draw arrow edge. Here, the arrow head points the instance of a resource, and tail of the process points to the process. For example, if a process needs ‘n’ instances of resource type, then we will draw ‘n’ assign edges.

Example of (RAG) Resource Allocation Graph

Example of Single Instance Resource Type

In the following example, we have two processes P1, and P2 and two resources which are R1, and R2. This example is a kind of single instance resource type, and it contain a cycle, so there is a deadlock in the system.

Resource Allocation Graph
          Allocation        Request
       R1     R2      R1     R2
Process P1       1       0        0       1
Process P2       0       1        1       0

                              Available = [R1 R2] = [0 0]

We can see in the following table, there is no instance of resource available, and to execute the process we need a resource. So, no process will be executed, and both the processes keep waiting for a long time. So, we can say that there is a deadlock in the system.

  1. Example of Multiple Instance Resource Type

The term multiple instances means the resources are having more instances. In the following example, we have three processes, which are P1, P2, and, P3 and three resources, which are R1, and R2.                 

Resource Allocation Graph
       Allocation        Request
      R1     R2       R1    R2
 Process P1      1     0        0      1
 Process P2       0     1        1      0
 Process P3       0      1        0       0

Now we check the current Availability = [R1 R2] = [0 0]

Now by using this availability, we check whether we can fulfill the request of any of the processes or not.

We can fulfill the demand or request of P3 because P3 is demanding nothing. So, when the process P3 gets successfully executed, we terminate the process P3.

Then we calculate availability,

             Availability = [0 0] + [0 1]

                                 = [ 0 1]

Now, based on the current availability, we can fulfill the requirement of the P1 process. So, we assign the requested resource to the process P1. When the process P1 executes successfully, then we terminate the process P1.

Now we again calculate availability

           Availablity = [0 1] [1 0]

                              = [1 1]

Now, again based on the current availability we fulfill the requirement of process P2 because the P2 process satisfies the requirement. So, we allocate the requested resource to the Process P2. When the process P2 executes successfully, then it terminates, and we again calculate the availability.

           Availability = [1 1] + [0 1]

                               = [1 2]

So, in this example, there is a safe sequence P3, P1, P2, and all the processes are executed successfully. So, we can say that system is in a safe state, and there is no deadlock in the system.