A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution
نویسندگان
چکیده
This paper presents a modified priority based probe algorithm for deadlock detection and resolution in distributed database systems. The original priority based probe algorithm was presented by Sinha and Natarajan based on work by Chandy, Misra, and Haas. Various examples are used to show that the original priority based algorithm either fails to detect deadlocks or reports deadlocks which do not exist in many situations. A modified algorithm which eliminates these problems is proposed. This algorithm has been tested through simulation and appears to be error free. Finally, the performance of the modified algorithm is briefly discussed.
منابع مشابه
Distributed Deadlock Detection using Fault Informing Probes
Pei-yu Li and Bruce McMillin, "Fault-tolerant Distributed Deadlock Detection/ Resolution", IEEE Transactions on parallel and distributed systems, pp 224-230, 1993. M. Tamer Ozsu and Patrick Valduriez, "Principles of Distributed Database Systems", Pearson Education, 1999. Chowdhary, A. N. , Kohler, W. H. , Stankovic, J. A. and Towsley, D. , "A modified priority based pro...
متن کاملA Novel Concurrent Generalized Deadlock Detection Algorithm in Distributed Systems
Detecting deadlocks has been considered an important problem in distributed systems. Many approaches are proposed to handle this issue; however, little attention has been paid on coordinating concurrent execution of distributed deadlock detection algorithms. Previous approaches may report incorrect results (false negatives), and they are inefficient due to lack of proper coordination of concurr...
متن کاملA Dynamic Priority Based Algorithm for Distributed Deadlock Detection and Resolution
In this paper we develop a distributed algorithm, using probes stamped with dynamic priorities, for detecting deadlocks in the single resource model. The correctness of the algorithm is proven. A dynamic priority is a pair where is a process and is the counter value in when initiates a deadlock detection computation. The pair is called a detector when it is referenced in a process or a resource...
متن کاملFault-tolerant distributed deadlock detection/resolution
The problem of deadlock detection in a distributed system has been extensively studied in the past few years. Many algorithms on distributed deadlock detection have been proposed under the assumption that the processors and communication in the system are fault-free. However, in an unreliable distributed system, faulty processors may prevent a deadlock detection algorithm from properly detectin...
متن کاملGuaranteed Deadlock Recovery: Deadlock Resolution with Rollback Propagation
Traditionally, deadlock resolution is performed by simply aborting any process or the lowest-priority process (called the victim) involved in a deadlock cycle. In message-passing applications where rollback propagation due to message dependencies is possible, the rollback of the victim may require other processes to roll back as well, and the restarted processes may get into the same deadlock a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Software Eng.
دوره 15 شماره
صفحات -
تاریخ انتشار 1989