Deadlock avoidance resource trajectories explained

broken image
broken image
broken image

The theorem 2, suggests the resource reservation with minimal resources. The correctness is proved in the form of theorem 1. This technique estimates the optimal number of resources needed for a deadlock free resource reservation policy. This paper presents a new resource reservation technique resource driven DFRR. When the unreserved resources are not sufficient for a process demand the reserve pool resources are used such that the process completes and releases all the resources it is holding. The unreserved resources are freely allocated to any process demanding it.

broken image

This class of technique reserves a portion of the resources. It has been extensively studied and recently a new class of resource reservation technique is researched upon for deadlock free resource management. Deadlock in a shared resource system is a well-known problem.

broken image