Banker’s Algorithm = number of processes and = n  number of resource types. Available: Vector of length m. If Available[j] = k, there are k  instances of resource type Rj available. Max: n m matrix. If Max[i,j] = k, then process Pi may   request at most k instances of resource type Rj. Allocation: n m matrix. If Allocation[i,j] = k, then process   Pi is currently allocated k instances of resource type Rj. Need: n m matrix. If Need[i,j] = k, then process Pi may   need k more instances of resource type Rj to complete its task. Need[i,j] = Max[i,j] - Allocation[i,j] 29 Safety Algorithm
Banker’s Algorithm  n = number of processes and = number of resource types.  Available: Vector of length m. If Available[j] = k, there are k instances of resource type Rj available.    Max: n  m matrix. If Max[i,j] = k, then process Pi may request at most k instances of resource type Rj. Allocation: n  m matrix. If Allocation[i,j] = k, then process Pi is currently allocated k instances of resource type Rj. Need: n  m matrix. If Need[i,j] = k, then process Pi may need k more instances of resource type Rj to complete its task. Need[i,j] = Max[i,j] - Allocation[i,j] 29 Safety Algorithm
dead%20lock.docx