Publication

Abstract :

The reliability and performance of concurrency are severely affected by deadlocks in concurrent systems. An efficient deadlock detection algorithm is needed to ensure that any deadlock cases can be pre-empted. The paper introduces a novel algorithm based on Tarjan's method for detecting deadlocks. The algorithm identifies strongly connected components in a directed graph and accurately tracks dependencies among processes using a wait-for graph, enabling precise deadlock detection in concurrent systems. It's implementation is described hereby and its performance is evaluated through extensive experiments on various scenarios. Therefore, this re- search has shown how important it is to detect deadlocks in these concurrent systems which improves their stability as well as reliability. The results demonstrates that the proposed deadlock detection algorithm performs its task efficiently, which is crucial for enhancing the consistency and stability of concurrent systems. This work makes a significant contribution to the development of deadlock detection techniques and offers valuable insights into their application. It is aimed at preventing deadlocks in real-world scenarios.