A Leader Election Based Deadlock Detection Algorithm In Distributed Systems

Deadlock detection is an important and challenge work in distributed systems. Thing becomes more complex when multiple deadlock detection algorithm instances executing currently in the system. In this paper, we propose a leader election based deadlock detection algorithm in distributed system. Our algorithm aims to improve the performance in the condition of concurrent execution. In addition, our algorithm can provide a certain extent of fault tolerance after a current leader fails. We have proved the liveness and safety property of our algorithm. Simulation results show that our algorithm obtains an order of magnitude performance improvement on message complexity