![]() Grid computing is a new, large and powerful self managing virtual computer out of large collection of connected heterogeneous systems sharing various combination of resources and it is the combination of computer resources from multiple administrative domains applied to achieve a goal, it is used to solve scientific, technical or business problem that requires a great number of processing cycles and needs large amounts of data. This modified banker's algorithm performs the process arrangement on the basis of their needs that leads to solve the problem in less time. It also gives details about all the resources and processes that which one requires resources and in what quantity. 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. The number of resources is not allowed to go down while it is in execution. 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. It needs to know how much of each resource a process could possibly request. 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. This also allocates the resource automatically to the stopped process for the execution and will always give the appropriate safe sequence for the given processes. It also give details about all the resources and processes that which one require resources and in what quantity. The number of resources are not allow to go down while it is in execution. ![]() Number of processes are static in algorithm, but in most of system processes varies dynamically and no additional process will be started while it is in execution. Banker's algorithm referred to as resource allocation and deadlock avoidance algorithm that checks for the safety by simulating the allocation of predetermined maximum possible of resources and makes the system into s-state by checking the possible deadlock conditions for all other pending processes.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |