Banker algorithm is one of the most representative algorithms to avoid deadlock. In the deadlock avoidance method, the process is allowed to apply for resources dynamically, but before the system allocates resources, the security of the allocated resources should be calculated first. If the allocation will not lead to the system entering an unsafe state, then the allocation, or wait. In order to implement banker algorithm, the system must set up several data structures.