Deadlocks in Operating System

Welcome to the course on topic “Deadlocks in Operating System”. This course explains basics of multi programmed operating system and deadlocks in operating system. Process management is an important topic in study of operating system. Process management involves creation, scheduling and termination  of process. In scheduling, OS allocates requested resources to the processes, if they are available. If resources are not available then process must wait, till it get allocated with requested resource. While performing these tasks, if process remain into wait state for infinite amount of time, then deadlock may occur. This affects performance of system.

This course starts with explanation of deadlock and how deadlocks happen. It then explains four necessary conditions for deadlock to occur. It includes explanation of the deadlock handling methods such as deadlock prevention and deadlock avoidance. This course helps learner to understand concepts in deadlock handling methods. It further explains safe state and Banker’s algorithm with solved example. Resource allocation graph method for handling deadlock avoidance in single instance resource system is also explained. After completing this course, learner will be able to understand deadlock terminologies and will be able to solve problems based on Banker’s algorithm example. Hope you all will enjoy this course.