Deadlock Avoidance based on Banker’s Algorithm for Waiting State Processes
Pankaj Kawadkar1, Shiv Prasad2, Amiya Dhar Dwivedi3
1Mr. Pankaj Kawadkar, Department of Computer Science PIES Bhopal, India.
2Mr. Shiv Prasad, M.Tech Scholar, PIES Bhopal, India.
3Mr. Amiya Dhar Dwivedi, Department of Computer Science, BCET Durgapur, India.
Manuscript received on November 01, 2013. | Revised Manuscript received on November 07, 2013. | Manuscript published on November 15, 2013. | PP: 1-2 | Volume-2 Issue-12, November 2013. | Retrieval Number: L07381121214/2014©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

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.
Keywords: Banker’s Algorithm, Circular Wait, Edsger Dijkstra, Hold & Wait, Mutual Exclusion, No Preemption.