Scribd
Upload
17 views3 pages

Expt8 Oslab

The document outlines an Operating System Lab experiment focused on demonstrating the Banker’s Algorithm for deadlock avoidance. It explains the algorithm's purpose in resource allocation and safety checks, likening it to a banking system's loan approval process. Additionally, it details the necessary data structures and the safety algorithm used to determine if a system is in a safe state.

Uploaded by

akbhai000008
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views3 pages

Expt8 Oslab

The document outlines an Operating System Lab experiment focused on demonstrating the Banker’s Algorithm for deadlock avoidance. It explains the algorithm's purpose in resource allocation and safety checks, likening it to a banking system's loan approval process. Additionally, it details the necessary data structures and the safety algorithm used to determine if a system is in a safe state.

Uploaded by

akbhai000008
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

S.S.P.

M’S COLLEGE OF ENGINEERING


A/P HARKUL-BUDRUK, KANKAVLI -416 602
Computer Science Department
(2024-25)
------------------------------------------------------------------------------------------------------------
Course Code: CSC404 Name: Operating System Lab

Class: SE Semester: IV

EXPT NO 8
Aim: Write a program to demonstrate Banker’s Algorithm for deadlock avoidance.

Theory:
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 comes 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.
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*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*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*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
• 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.
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:

1) Let Work and Finish be vectors of length ‘m’ and ‘n’ respectively.
Initialize: Work = Available
Finish[i] = false; for i=1, 2, 3, 4….n
2) Find an i such that both a)
Finish[i] = false
b) Needi <= Work if no such i
exists goto step (4)
3) Work = Work + Allocation[i]
Finish[i] = true goto
step (2)
4) if Finish [i] = true for all i then the system is in a safe
state
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:

You might also like