Earlier I have described about deadlock in computing. In this article, I am going to discuss about the necessary conditions, those hold simultaneously in a system to arise deadlock situation.
We can discuss these necessary conditions more precisely in terms of a directed graph called a system resource-allocation graph. So I used related diagrams with description.
In this diagrams rounded rectangles visualize a resource and dots inside it visualize number of instances of the resource.Circles visualize processes.
Mutual Exclusion
In this scenario, there is a one resource(R1) with non-shareable mode. That means only one process can be used at a time. If another process requests that resource(P1), the requesting process(P1) must be wait until the resource has been released by first process(P2).