7.5.

3 Banker's Algorithm
1.When a process enters the system , it must declare the
maximum number of instance of each
resource type that it may need.
( number of instance < number of total resources in system)
2.User request a set of resources .
3.System will decide if the allocation of the resource will leave
system in safe state.
a) Yes = resources are allocated .
b) No = process waits until other process releases its resource.
ata Structure to implement the algorithm
Available
(How much of each resource each process is currently holding)
Max
(How much of each resource each process could possibly request)
Allocation
(How much of each resource the system currently has available)
Need
(How much of each resource the system currently needs to continue)
llustrative Example
A||ocat|on Max Ava||ab|e
A8C A8C A8C
o 010 733 332
1 200 322
2 302 902
3 211 222
4 002 433
A8C
o 743
1 122
2 600
3 011
4 431
need Max AllocaLlon
A||ocat|on Need Ava||ab|e
A8C A8C A8C
o 010 743 230
1 200 020
2 302 600
3 211 011
4 002 431
SafeLy AlgorlLhm Sequence 143o2