An Experimental Execution Of Deadlock Algorithms

Abstract

A deadlock condition occurs when a set of processes requests the same resource which is currently being held/allocated to some other processes. The process which is in deadlock state will wait for a large amount of time and they will never terminate their executions and the resources which are held by that set of processes cannot be made available to any other processes which may sometimes lead to a system failure. There are methods for handling deadlocks such as deadlock prevention or avoidance, ignoring the problem altogether, and deadlock detection and recovery. Also, various conditions may help prevent deadlock to some extent but to completely eradicate deadlock from the system an efficient operating system needs to be developed with efficient synchronization algorithms. In this paper we have provided a practical implementation of deadlock scenario as well as deadlock concepts which includes Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait, Process Termination, Selecting Victim, Rollback, and starvation. Java Programming language is utilized for developing all algorithms which we have presented in this paper.