Banking Algorithm Terminologies

1. Available:

• This is used to define resource availability.
• It is depicted by Available[j] notation.

2. Max:

• This is used to depict the maximum resources a matrix can store.

3. Allocation:

• A matrix depicting the resources allocated to complete the assigned work.

4. Need:

• A matrix depicting the resources needed to complete the assigned work.
• Matrix is depicted with Need[i][j]

5. Finish:

• This is used to define a boolean value to determine if process has the required resources and if resources get released after task finished.

Distributed systems have a banker’s algorithm which serves as a deadlock avoidance algorithm. Bankers algorithm depicts the resource allocation strategy which can help in determining the availability of resources in the present or future and how these availability of resources will lead a Bankers’ system to go into deadlock. Different data structures can be used to implement the banker’s algorithm.