An Algorithm for Avoiding Deadlock

Deadlock is as condition that arises when multiple processes are waiting for resources held by other processes. A process cannot release the resources it holds until it can acquire the resources it is waiting for, but it cannot acquire these resources until another process releases them. There are few strategies to deal with the deadlock i.e. detection and recovery, deadlock prevention and deadlock avoidance etc. Deadlock can be avoided if certain information about processes is available in advance of resource allocation. For every resource request, the system sees if granting the request would mean that the system would enter an unsafe state, meaning a state that could result in deadlock. The system then only grants request that would lead to safe states. In this paper a method has been proposed to avoid the deadlock in multiprocessor system. A multiprocessor system with two processors has been used here. Two resources i.e. flash drive and printer have been used here. This paper explains how these processes request and release these resources and overcome unsafe state to enter the safe state. Finally, the deadlock avoidance algorithm for multiprocessors system is presented