Deadlock in a shared resource system is a well-known problem. It has been extensively studied and recently a new class of resource reservation technique is researched upon for deadlock free resource management. This class of technique reserves a portion of the resources. The unreserved resources are freely allocated to any process demanding it. 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. This paper presents a new resource reservation technique resource driven DFRR. This technique estimates the optimal number of resources needed for a deadlock free resource reservation policy. The correctness is proved in the form of theorem 1. The theorem 2, suggests the resource reservation with minimal resources. The overhead of the resource pool estimation is \(O\left(n\right)\) and that of resource management is \(O\left(m\right)\) which is optimal for any deadlock handling technique. The effectiveness of the proposed technique is shown in the form of examples and simulation results.

共享资源系统中的死锁是一个众所周知的问题。它已被广泛研究，最近研究了一类新的资源预留技术，用于无死锁资源管理。这类技术保留了一部分资源。未保留的资源被自由分配给任何需要它的进程。当未保留的资源不足以满足进程需求时，将使用保留池资源，以便进程完成并释放它所持有的所有资源。本文提出了一种新的资源预留技术资源驱动的DFRR。该技术估计无死锁资源预留策略所需的最佳资源数量。用定理 1 的形式证明了正确性。定理 2 建议用最少的资源进行资源预留。\(O\left(n\right)\)和资源管理是\(O\left(m\right)\)，这对于任何死锁处理技术都是最佳的。所提出技术的有效性以示例和仿真结果的形式显示。