An Efficient Generalized Deadlock Detection and Resolution Algorithm in Distributed Systems

2005 ◽  
Author(s):  
N. Farajzadeh ◽  
M. Hashemzadeh ◽  
M. Mousakhani ◽  
A.T. Haghighat
Keyword(s):  
Distributed Systems ◽  
Deadlock Detection ◽  
Resolution Algorithm

scholarly journals An Improved Multi-Cycle Deadlock Detection and Resolution Algorithm for Distributed Systems

2014 ◽  
Vol 3 (3) ◽  
pp. 111-120
Author(s):  
Mohsen Askari ◽  
Rozita Jamili Oskouei
Keyword(s):  
Distributed Systems ◽  
Data Sharing ◽  
Deadlock Detection ◽  
A Algorithm ◽  
System A ◽  
Memory Overhead ◽  
Resolution Algorithm ◽  
High Degree ◽  
Available Resources

Distributed systems exhibit a high degree of resource and data sharing creating a state in which deadlocks might make their appearance. Since deadlock detection and resolution  is one of the important concerns in distributed systems which lead to minimizing available resources, therefore instigating   the  system  throughput decrease.  Our  proposed algorithm detects and resolves  the  multi-cycle  deadlocks, whether the initiator is involved in the deadlock cycle directly or indirectly. Also the chance  of  phantom  deadlock  detection is minimized. This  algorithm  not  only  can manage the simultaneous execution of it but also detects the multi-cycle deadlocks in  the  distributed  systems. Our  algorithm introduces a modified probe and victim message  structure. Moreover,  no  extra  storage  required  to  store  prob message  in each node which is known as memory overhead in the distributed systems.

Deadlock detection in distributed systems

Computer ◽  
1989 ◽  
Vol 22 (11) ◽  
pp. 37-48 ◽  
Author(s):  
M. Singhal
Keyword(s):  
Distributed Systems ◽  
Deadlock Detection

A Hybrid Algorithm for Fast Detection and Resolution of Generalized Deadlocks in Distributed Systems

2005 ◽  
Vol 277-279 ◽  
pp. 171-176
Author(s):  
Soo Jung Lee ◽  
Kwang Moon Cho
Keyword(s):  
Distributed Systems ◽  
Hybrid Algorithm ◽  
Deadlock Detection ◽  
Detection Time ◽  
Fast Detection ◽  
Message Length ◽  
Computation Technique ◽  
Diffusing Computation

In the literature only a handful of studies have been performed on the distributed deadlock problem in the generalized request model. Most of those algorithms use either the diffusing computation technique or have the initiator collect all the dependency information among processes. This paper proposes an algorithm which incorporates these two methods with the following properties: first, it removes the reduction phase of the diffusing computation; second, it encodes the dependency information to reduce message length, rather than transmitting it naively as is. The main advantage of the proposed algorithm is that deadlock detection time is reduced to almost half of that of the existing algorithms.

A distributed deadlock detection and resolution algorithm and its correctness proof

1988 ◽  
Vol 14 (10) ◽  
pp. 1443-1452 ◽  
Author(s):  
A.K. Elmagarmid ◽  
N. Soundararajan ◽  
M.T. Liu
Keyword(s):  
Deadlock Detection ◽  
Correctness Proof ◽  
Resolution Algorithm
Sign in / Sign up

Export Citation Format

Share Document