Deadlock Avoidance based on Banker’s Algorithm for Waiting State Processes
P. Kawadkar, S. Prasad, and A. Dwivedi. International Journal of Innovative Science and Modern Engineering (IJISME), 2 (12):
1-2(November 2014)
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.
%0 Journal Article
%1 noauthororeditor
%A Kawadkar, Pankaj
%A Prasad, Shiv
%A Dwivedi, Amiya Dhar
%D 2014
%E Kumar, Dr. Shiv
%J International Journal of Innovative Science and Modern Engineering (IJISME)
%K & Algorithm Banker’s Circular Dijkstra Edsger Exclusion Hold Mutual No Preemption Wait
%N 12
%P 1-2
%T Deadlock Avoidance based on Banker’s Algorithm for Waiting State Processes
%U https://www.ijisme.org/wp-content/uploads/papers/v2i12/L07381121214.pdf
%V 2
%X 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.
@article{noauthororeditor,
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.},
added-at = {2021-09-22T10:35:16.000+0200},
author = {Kawadkar, Pankaj and Prasad, Shiv and Dwivedi, Amiya Dhar},
biburl = {https://www.bibsonomy.org/bibtex/2f45cd247e24fea0567ad1dcb0e680ddd/ijisme_beiesp},
editor = {Kumar, Dr. Shiv},
interhash = {484871d87fe472f5995988008c5bfb02},
intrahash = {f45cd247e24fea0567ad1dcb0e680ddd},
issn = {2319-6386},
journal = {International Journal of Innovative Science and Modern Engineering (IJISME)},
keywords = {& Algorithm Banker’s Circular Dijkstra Edsger Exclusion Hold Mutual No Preemption Wait},
language = {En},
month = {November},
number = 12,
pages = {1-2},
timestamp = {2021-09-22T10:35:16.000+0200},
title = {Deadlock Avoidance based on Banker’s Algorithm for Waiting State Processes},
url = {https://www.ijisme.org/wp-content/uploads/papers/v2i12/L07381121214.pdf},
volume = 2,
year = 2014
}