Banker's 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.
AllocationIndicates the number of available resources of each type
MaxDefines the maximum demand of each process in a system.
AvailableDefines the number of resources of each type currently allocated to each process
No. A B C A B C A B C
p0