an efficient deadlock avoidance technique

But they fail to provide significant improvement in system performance and also deadlock-free. This algorithm grants requesting resources to processes for execution and analyze the state whether in safe or unsafe after every possible situation.

Authors implemented resource request algorithm to avoid deadlocks with the help of simulating software. They present a multi core communication API which enhances lock-free messaging and data exchange latency between processes. Removing the locks is significant overhead and propose performance based lock-free algorithms in multi core systems which reduces the possibility of concurrency defects and risk of deadlock. So this implementation of more than one lock leads the risk of deadlock. But these locking mechanisms with significant processing overhead reduce the system performance especially for multi core processing systems where processes execute on different cores in queues waiting to acquire a lock. Authors introduced a new metric Mean Normalized Blocking Time to compare locking mechanisms and also provide two different semaphore models for existing real-time systems in the automotive power environment. Resource allocation is a critical issue in shared or concurrent systems where resources are shared to avoid deadlocks. Section 4 illustrates experimental results and analysis. Section 3 presents the proposed Resource driven-Deadlock-free technique and its effectiveness is explained with the help of example along with comparisons of other existing techniques.

2, provides a further look at the existing literature. The rest of the paper is organized as follows: Sect. The correctness of the proposed technique can be proved in form of theorems and with the help of example and simulation results. The main objective of this paper is to find optimal number of resources needed by processes to complete the execution without deadlocks in a system and also estimates how many minimal number resources of each type are sufficient. They reserve a set of resources and blindly allocate the remaining to processes for successful execution and also reduce the overhead usually caused by all other deadlock avoidance algorithms. These techniques are neither proactive nor reactive in the absolute sense. Recently, a new class of techniques called Resource Reservation Techniques (RR) is also used for deadlock handling. The system periodically monitors for a deadlock occurrence and performs recovery action in case a deadlock is detected. The next set of solutions is event based where the system does not do any resource management rather waits for a deadlock event. The second set of Deadlock avoidance (DA), is a look forward technique to avoid deadlock in the future. They suggest ensuring that one of the necessary conditions does not hold. Thus, the first set of the Deadlock prevention (DP) resource management solution for a deadlock problem lies around these conditions. These conditions are Mutual exclusion, Hold and wait, No pre-emption, and Circular wait condition. Deadlocks will not always occur but as suggested by Coffman it occurs if certain necessary conditions hold. Deadlock has been a big concern in both computing and non-computing shared resource systems and has been extensively studied for decades.

Deadlocks adversely affect the system performance sometimes making it irresponsive so they are highly undesirable. The computing systems using shared resources, sometimes enter into a Deadlock, after which they are unable to execute further. The effectiveness of the proposed technique is shown in the form of examples and simulation results.Ĭomputing systems such as real-time, IoT, distributed, parallel, cluster, cloud computing systems, share resources for their effective utilization. The overhead of the resource pool estimation is O n and that of resource management is O m which is optimal for any deadlock handling technique. 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. 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.

An efficient deadlock avoidance technique