# Dijkstra’s Banker’s algorithm detailed explanation

Even after reading many articles on Banker’s algorithm and Europe’s deadlock several times, I couldn’t get what they were about. I didn’t understand how an algorithm could have solved...

Even after reading many articles on Banker’s algorithm and Europe’s deadlock several times, I couldn’t get what they were about.

I didn’t understand how an algorithm could have solved with the debt crisis.

I realized I would have to go back to the basics of banking and figure out answers to these:

How do banks work? How do banks decide the loan amount? What is the Banker’s algorithm?

## What is banker’s algorithm?

The Banker’s algorithm sometimes referred to as avoidance algorithm or Deadlock algorithm was developed by Edsger Dijkstra (another of Dijkstra’s algorithms!).

It tests the safety of allocation of predetermined maximum possible resources and then makes states to check the deadlock condition. (Wikipedia)

### Banker’s algorithm explained

Let’s say you’ve got three friends (Chandler, Ross, and Joey) who need a  loan to tide them over for a bit.

You have $24 with you. Chandler needs$8 dollars, Ross needs $13, and Joey needs$10.

You already lent $6 to Chandler,$8 to Ross, and $7 to Joey. So you are left with$24 – $21 (6+8+7) =$3

Even after giving $6 to Chandler, he still needs$2. Similarly, Ross needs $5 more and Joey$3.

Until they get the amount they need, they can neither do whatever tasks they have to nor return the amount they borrowed. (Like a true friend!)

You can pay $2 to Chandler, and wait for him to get his work done and then get back the entire$8.

Or, you can pay $3 to Joey and wait for him to pay you back after his task is done. You can’t pay Ross because he needs$5 and you don’t have enough.

You can pay him once Chandler or Joey returns the borrowed amount after their work is done.

This state is termed as the safe state, where everyone’s task is completed and, eventually, you get all your money back.

### The second scenario – Deadlock explained

Knowing Ross needs $10 urgently, instead of giving$8, you end up giving him $10. And you are left with only$1.

In this state, Chandler still needs $2 more, Ross needs$3 more, and Joey still needs $3 more, but now you don’t have enough money to give them and until they complete the tasks they need the money for, no money will be transferred back to you. This kind of situation is called the Unsafe state or Deadlock state, which is solved using Banker’s Algorithm. Let’s get back to the previous safe state. You give$2 to Chandler and let him complete his work.

He returns your $8 which leaves you with$9. Out of this $9, you can give$5 to Ross and let him finish his task with total \$13 and then return the amount to you, which can be forwarded to Joey to eventually let him complete his task.

(Once all the tasks are done, you can take Ross and Joey to Central Perk for not giving them a priority.)

The goal of the Banker’s algorithm is to handle all requests without entering into the unsafe state, also called a deadlock.

The moneylender is left with not enough money to pay the borrower and none of the jobs are complete due to insufficient funds, leaving incomplete tasks and cash stuck as bad debt.

It’s called the Banker’s algorithm because it could be used in the banking system so that banks never run out of resources and always stay in a safe state.

### Banker’s Algorithm

For the banker’s algorithm to work, it should know three things:

1. How much of each resource each person could maximum request [MAX]
2. How much of each resource each person currently holds [Allocated]
3. How much of each resource is available in the system for each person [Available]

So we need MAX and REQUEST.

If REQUEST is given MAX = ALLOCATED + REQUEST

NEED = MAX – ALLOCATED

A resource can be allocated only for a condition.

REQUEST<= AVAILABLE or else it waits until resources are available.

Let ‘n’ be the number of processes in the system and ‘mbe the number of resource types.

• Available – It is a 1D array of size ’m’. Available [j] = k means there are k occurrences of resource type Rj.
• Maximum – It is a 2D array of size ‘m*n’ which represents maximum demand of a section. Max[i,j] = k means that a process i can maximum demand ‘k’ amount of resources.
• Allocated – It is a 2D array of size ‘m*n’ which represents the number of resources allocated to each process. Allocation [i,j] =k means that a process is allocated ‘k’ amount of resources.
• Need – 2D array of size ‘m*n’. Need [i,j] = k means a maximum resource that could be allocated.
• Need [i,j] = Max [i,j] – Allocation[i,j]

### Take another Banker’s Algorithm example in the form of the table below

Where you have 4 processes, and 3 resources (A, B, C) to be allocated.

 Process Allocated Maximum Available Need (Maximum Allocated) A B C A B C A B C A B C P1 0 1 0 7 5 3 3 3 2 7 4 3 P2 2 0 0 3 2 2 1 2 2 P3 4 0 1 9 0 4 5 0 3 P4 2 1 1 2 2 2 0 1 1

Need P2<Available, so we allocate resources to P2 first.

After P2 completion the table would look as

 Process Allocated Maximum Available Need (Maximum Allocated) A B C A B C A B C A B C P1 0 1 0 7 5 3 5 3 2 7 4 3 P3 4 0 1 9 0 4 5 0 3 P4 2 1 1 2 2 2 0 1 1

Need P4<Available, so we allocate resources to P4.

After P4 completion

 Process Allocated Maximum Available Need (Maximum Allocated) A B C A B C A B C A B C P1 0 1 0 7 5 3 7 4 3 7 4 3 P3 4 0 1 9 0 4 5 0 3

And P3 will be allocated before P1, which gives us the sequence P2, P4, P3, and P1 without getting into deadlock.

A state is considered safe if it is able to finish all processing tasks.

### Banker’s algorithm using C++

If you understood the process, congratulations on being a non-certified banker of the nation!