Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
767 views

Lab 14 - Bankers Algorithm

The document discusses the Banker's Algorithm which is used to detect and avoid deadlocks by testing if the system is in a safe state before allocating resources to processes, it explains the data structures like Available, Max, Allocation, and Need used to implement the algorithm, and provides an example of running the Banker's Algorithm on a system with 5 processes and 3 resource types to determine if granting additional resource requests results in a safe state.

Uploaded by

Gurru
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
767 views

Lab 14 - Bankers Algorithm

The document discusses the Banker's Algorithm which is used to detect and avoid deadlocks by testing if the system is in a safe state before allocating resources to processes, it explains the data structures like Available, Max, Allocation, and Need used to implement the algorithm, and provides an example of running the Banker's Algorithm on a system with 5 processes and 3 resource types to determine if granting additional resource requests results in a safe state.

Uploaded by

Gurru
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Lab 14 Deadlocks

Design, develop and run a program to implement the


Bankers Algorithm.
The banker’s algorithm is a resource allocation and deadlock avoidance algorithm that
tests for safety by simulating the allocation for predetermined maximum possible
amounts of all resources, then makes an “s-state” check to test for possible activities,
before deciding whether allocation should be allowed to continue.
Why Banker’s algorithm is named so?
Banker’s algorithm is named so because it is used in banking system to check whether
loan can be sanctioned to a person or not. Suppose there are n number of account
holders in a bank and the total sum of their money is S. If a person applies for a loan
then the bank first subtracts the loan amount from the total money that bank has and if
the remaining amount is greater than S then only the loan is sanctioned. It is done
because if all the account holders come to withdraw their money then the bank can
easily do it.
In other words, the bank would never allocate its money in such a way that it can no
longer satisfy the needs of all its customers. The bank would try to be in safe state
always.
Data Structures used to implement Bankers algorithm:
Following Data structures are used to implement the Banker’s Algorithm:

Let ‘n’ be the number of processes in the system and ‘m’ be the number of resources
types.

Available:
 It is a 1-d array of size ‘m’ indicating the number of available resources of each
type.
 Available [ j ] = k means there are ‘k’ instances of resource type Rj

Max:
 It is a 2-d array of size ‘n x m’ that defines the maximum demand of each process
in a system.
 Max[ i, j ] = k means process Pi may request at most ‘k’ instances of resource
type Rj.

Allocation:
 It is a 2-d array of size ‘n x m’ that defines the number of resources of each type
currently allocated to each process.
 Allocation[ i, j ] = k means process Pi is currently allocated ‘k’ instances of
resource type Rj
Need :
 It is a 2-d array of size ‘n x m’ that indicates the remaining resource need of each
process.
 Need [ i, j ] = k means process Pi currently need ‘k’ instances of resource type Rj
for its execution.
How to determine Need:
 Need [ i, j ] = Max [ i, j ] – Allocation [ i, j ]
 Allocationi specifies the resources currently allocated to process Pi and
Needi specifies the additional resources that process Pi may still request to
complete its task.

Bankers Algorithm:
Banker’s algorithm consists of Safety algorithm and Resource request algorithm.

Safety Algorithm:
The algorithm for finding out whether or not a system is in a safe state can be described
as follows:
Resource-Request Algorithm:
Let, Requesti be the request array for process Pi. Requesti [j] = k means process Pi
wants k instances of resource type Rj. When a request for resources is made by
process Pi, the following actions are taken:

Finally, run the safety algorithm to determine that with the new state of system weather
there is deadlock or not .

If System is in safe sate > Resource Request can be granted

Else > Resource Request rejected


Example:

Considering a system with five processes P0 through P4 and three resources of


type A, B, C. Resource type A has 10 instances, B has 5 instances and type C has
7 instances. Suppose at time t0 following snapshot of the system has been taken:

Question1. What will be the content of the Need matrix?

Need [i, j] = Max [i, j] – Allocation [i, j]


So, the content of Need Matrix is:

Question2. Is the system in a safe state? If Yes, then what is the safe sequence?

Applying the Safety algorithm on the given system,


Question3. What will happen if process P1 requests one additional instance of resource
type A and two instances of resource type C?

We must determine whether this new system state is safe. To do so, we again execute Safety
algorithm on the above data structures.
Hence the new system state is safe, so we can immediately grant the request for process P1 .

Lab Assignment:
Implement the Bankers algorithm and demonstrate its working with different data.

You might also like