DEADLOCK AVOIDANCE

Abstract

This seminar paper is focused on deadlock avoidance. Deadlock can be defined as a situation where a set of processes are blocked because each process is holding a resource and waiting for another resource acquired by some other process In deadlock avoidance, the request for any resource will be granted if the resulting state of the system doesn't cause deadlock in the system. In order to avoid deadlocks, the process must tell OS, the maximum number of resources a process can request to complete its execution. A deadlock prevention algorithm organizes resource usage by each process to ensure that at least one process is always able to get all the resources it needs. One such example of deadlock algorithm is Banker's algorithm