Abstract
This paper presents an algorithm for deadlock avoidance used for Waiting State processes. This method is an improvement over Banker’s algorithm. In Banker’s algorithm, when processes goes to waiting state then there is no proper approach (FCFS is not sufficient) are available for the sequencing of waiting processes. In this paper a methodology has been proposed, which consider the number of allocated resources and/or number of instances as well as need of resources in order to select a waiting process for the execution.
Users
Please
log in to take part in the discussion (add own reviews or comments).