In: Computer Science
In operating systems class you experienced a little about how simulation can be applied in analyzing scheduling and deadlock problems.
In a deadlock situation the process is blocked because the current running process will be acquired by the another process.So this process cannot be normal until and unless we reset it to normal manually.
This situation of deadlock can be prevented by using certain protocols which will prevent the deadlock to occur.so that it can be detected and prevented.
In some scenarios the operating system behaves like the deadlock is not occurred,Because the deadlock is ignored and cannot be detected by the operating system.some additional information must be provided to the operating system so that it can avoid the deadlocks.
By using a wait for graph we can detect deadlocks in this we can obtain the graph from the resource nodes by which the graph can be collapsed.and also the number of processes that are affected when the deadlock has occurred must be analyzed.we can abort all the deadlock processes so that the deadlock cycle can be broken.