A Dynamic and Improved Implementation of Banker’s Algorithm

Abstract

Banker’s algorithm can be described as deadlock avoidance and resource allocation algorithm which ensure the execution safety by simulating the allocation of already determined maximum possible of resources and makes the system into s-state by checking the possible deadlock conditions for all other pending processes. It needs to know how much of each resource a process could possibly request. Number of processes is static in algorithm, but in most of system processes varies dynamically and no additional process will be started while it is in execution. The number of resources is not allowed to go down while it is in execution. In this research an approach for Dynamic Banker's algorithm is proposed which allows the number of resources to be changed at runtime that prevents the system to fall in unsafe state. It also gives details about all the resources and processes that which one requires resources and in what quantity. This modified banker’s algorithm performs the process arrangement on the basis of their needs that leads to solve the problem in less time.