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

Banker’s Algorithm in Operating System

What is Banker’s Algorithm?

Bankers algorithm is an algorithm which is used for deadlock avoidance and resource allocation. It was established by Edsger Dijkstra. The reason behind the name ‘banker’s algorithm’ is that it is mostly used in banking systems. Banker’s algorithm helps to identify whether a loan should be provided or not.

Characteristics of Banker’s Algorithm

The characteristics of Banker’s algorithm are:

  1. If a process demands the resources, then it has to wait.
  2. Banker’s algorithm consists of advanced features for maximum resource allocation.
  3. In the banker’s algorithm, various resources are maintained that fulfill the needs of at least one client.
  4. In the system, we have limited resources.
  5. In the banker’s algorithm, if the process gets all the needed resources, then it is must to return the resources in a restricted period.

Disadvantages of Banker’s Algorithm

The disadvantages of banker’s algorithm are:

  1. During processing, it does not permit a process to change its maximum need.
  2. All the processes should know in advance about the maximum resource needs.
  3. Banker’s algorithm permits the requests to be provided in constrained time, but for one year which is a fixed period.

 Data Structures used to implement the Banker’s Algorithm

There are four types of data structures used to implement Banker’s algorithm:

  1. Available
  2. Max
  3. Allocation
  4. Need

1. Available

  • Available is a one-dimensional array. The size of the array is ‘m’ which is used to determine the number of available resources of each kind.
  • Available[j] = k indicates that we have ‘k’ instances of ‘Rj’ resource type.

2. Max

  • Max is a two-dimensional array. The size of the array is ‘n*m’. The max data structure is used to determine the maximum number of resources that each process requests.
  • Max[i, j] = k indicates that ‘Pi’ can demand or request maximum ‘k’ instances of ‘Rj’ resource type.

3. Allocation

  • Allocation is a two-dimensional array, and the size of the array is ‘n*m’, which is used to define the number of resources of each kind presently assigned to each process.
  • Allocation[i, j] = k indicates that currently process ‘Pi’ is assigned ‘k’ instances of ‘Rj’ resource type.

4. Need

  • Need is a two-dimensional array. The size of the array is ‘n*m’. Need is used to define the remaining resources which are required for each process.
  • Need [i, j] = k indicates that for the execution of ‘Pi’ process, presently ‘k’ instances of resource type ‘Rj’ are required.

Banker’s algorithm comprises of two algorithms:

  1. Safety algorithm
  2. Resource request algorithm

1. Safety algorithm

The safety algorithm is used to check the system state means whether the system is in a safe state or not.

The safety algorithm contains the following steps:

Banker’s Algorithm

2. Resource Request Algorithm

Let Requesti is the request array for the process ‘Pi’. Requesti [j] = k means ‘Pi’ process needs k instances of Rj resource type. At the time   when a process Pi demands  resources, then we follow the below steps.

Banker’s Algorithm

Example of Banker’s Algorithm

Consider the following snapshot of a system:

Processes Allocation
A   B    C
A   B   C
A   B   C
      P0 1     1     2  4    3    3   2    1    0
      P1 2     1     2  3    2    2  
      P2 4     0     1  9    0    2  
      P3 0     2     0  7    5    3  
      P4 1     1     2  1    1    2  
  1. calculate the content of the need matrix?
  2. Is the system in a safe state?
  3. Determine the total amount of resources of each type?


1. Content of the need matrix can be calculated by using the below formula

Need = Max – Allocation

2. Now, we check for a safe state

Safe sequence:

  1.  For process P0, Need = (3, 2, 1) and

                           Available = (2, 1, 0)

             Need ? Available = False

   So, the system will move for the next process.

2. For Process P1, Need = (1, 1, 0)

                  Available = (2, 1, 0)

    Need ? Available = True

              Request of P1 is granted.

                ?                          Available = Available +Allocation

                                                              = (2, 1, 0) + (2, 1, 2)

                                                             = (4, 2, 2) (New Available)

3. For Process P2, Need = (5, 0, 1)

                   Available = (4, 2, 2)

     Need ? Available = False

So, the system will move to the next process.

4. For Process P3, Need = (7, 3, 3)

                  Available = (4, 2, 2)

          Need ? Available = False

So, the system will move to the next process.

5. For Process P4, Need = (0, 0, 0)

                   Available = (4, 2, 2)

              Need ? Available = True

                Request of P4 is granted.

                ?                          Available = Available + Allocation

                                        = (4, 2, 2) + (1, 1, 2)

                                        = (5, 3, 4) now, (New Available)

6. Now again check for Process P2, Need = (5, 0, 1)

                                               Available = (5, 3, 4)

                                          Need ? Available = True

                Request of P2 is granted.

                ?                          Available = Available + Allocation

                                                             = (5, 3, 4) + (4, 0, 1)

                                                             = (9, 3, 5) now, (New Available)

7. Now again check for Process P3, Need = (7, 3, 3)

                                              Available = (9, 3, 5)

                                          Need ? Available = True

                Request of P3 is granted.

                ?                          Available = Available +Allocation

                                                             = (9, 3, 5) + (0, 2, 0) = (9, 5, 5)

8. Now again check for Process P0, = Need (3, 2, 1)

                                                      = Available (9, 5, 5)

                         Need ? Available = True

So, the request will be granted to P0.

Safe sequence: < P1, P4, P2, P3, P0>

The system allocates all the needed resources to each process. So, we can say that system is in a safe state.

3. The total amount of resources = sum of columns of allocation + Available

                                                             = [8 5 7] + [2 1 0] = [10 6 7]