In this chapter, we are going to model deadlock condition by using directed graph. Here we use directed graph to show whether it is requesting resources or holding resources. And circle are used to denote process whereas rectangle refers the resources.
In fact, there is not solution of deadlock condition, that is why it is known as non-resolving situation. But a good programmer must be known with this fact before working on any project. S/he must be careful about the dealing of deadlock. A programmer has to consider 4 strategies to deal with deadlock. They are as follows:
- Ignoring the deadlock problem
- Detection and Recovery
- Avoiding Dynamically with Resource Allocation
- Prevention of Deadlock