Deadlock avoidance
It is one of the methods of dynamically escaping from the dead locks. The word
dynamically means ‘Online’. In this scheme if a process request for resources the
avoidance algorithm checks before the allocation of resources about the state of system. If
the state is safe the system allocate the resources to the requesting process otherwise
(unsafe) do not allocate the resources. So taking care before the allocation is said to be
deadlock avoidance.
Safe state: No deadlock will happen, even we allocate the resources to requesting
processes.
Banker’s algorithm
It is deadlock avoidance algorithm, the name was chosen because the bank never
allocates more than the available cash.
Multiple instances.
Each process must a priori claim maximum use.
When a process requests a resource it may have to wait.
When a process gets all its resources it must return them in a finite amount of time.
Deadlock
Safe
Unsafe
