Stochastic analysis of distributed deadlock scheduling (original) (raw)

Performance analysis of distributed deadlock detection algorithms

… and Data Engineering, IEEE Transactions on, 2001

The paper presents a probabilistic performance analysis of a deadlock detection algorithm in distributed systems. Although there has been extensive study on deadlock detection algorithms in distributed systems, little attention has been paid to the study of the ...

Deadlock Detection Scheduling for Distributed Processes in the Presence of System Failures

2010 IEEE 16th Pacific Rim International Symposium on Dependable Computing, 2010

The occurrence of deadlocks should be controlled effectively by their detection and resolution, but may sometimes lead to a serious system failure. This fact implies that deadlock detection scheduling should be designed from the view points of not only the performance trade-off between overall message usage and deadlock persistence time but also the prevention of the system failure. In this paper, we reformulate the Ling et al.'s deadlock detection scheduling problem (2006) in the presence of system failures, and derive the optimal deadlock detection time minimizing the long-run average cost per unit time. By introducing the message complexities of the deadlock detection and resolution algorithms being used, we investigate the asymptotically optimal frequency of deadlock detection scheduling in terms of the number of distributed processes through the wellknown Landau notation.

On-Line Detection and Resolution of Communication Deadlocks

1994

with false deadlocks. 13, 16, 17, 18, 20, 211. There are four categories of deadlock algorithms [12]: path-pushing, edge-chasing, diffusing computations and global state detection. In this paper, we restrict our attention to edge-chasing (or probe-based) algorithms [5, 13, 16, 18, 20, 211. 'This work was supported in part by the Consortium for International Earth Science Information Networking.

Study of Diverse Models of Deadlock Detection in Distributed Environment

A distributed system is much larger and more prevailing than typical centralized systems due to the combined capabilities of distributed components. Examples of distributed systems include computer networks, distributed databases, distributed information processing systems and real time process control systems. In this paper, we review diverse models that are used to classify deadlock detection algorithms and determine the condition for detecting deadlock.

Efficient Detection and Resolution of Generalized Distributed Deadlocks

IEEE Transactions on Software Engineering, 1994

In this paper, we propose a new algorithm to detect and resolve distributed deadlocks in the generalized model. The initiator of the proposed algorithm diffuses the probes along the outgoing edges of Wait-For Graph (WFG) and collects the replies that carry the dependency information between processes directly. However, the initiator simplifies the unblocking conditions of blocked nodes in response to a reply form an unblocked node and receives almost two replies from any node unlike the earlier algorithms. It finally declares all the nodes that have not been reduced as deadlocked. We also prove the correctness of the algorithm. It has a worst-case time complexity of d+1 and message complexity of less than e+2n where d is the diameter, e is the number of edges and n is the number of nodes in the WFG. Since the termination detection of the proposed algorithm is isolated from deadlock detection, it minimizes the message length into a constant without using any explicit technique. It is the significant improvement over the existing algorithms. It also minimizes additional rounds of messages to resolve deadlocks.

A Survey on Distributed Deadlock Detection Algorithm and its performance Evolution

2015

Deadlock is one of the most serious problems in distributed systems environment and detection of deadlock has undergone extensive study. A deadlock is a condition in a system where a process cannot proceed because it needs to obtain a resource held by another process which itself is holding a resource that the other process needs .In literature, various techniques have been discussed so far which are used to prevent, detect and resolve the deadlocks. In this paper we survey the various detection algorithms and their performance in distributed environment. The paper introduces a uniform framework for the discussion of these algorithms.

Distributed deadlock detection algorithm

ACM Transactions on Database Systems (TODS), 1982

We propose an algorithm for detecting deadlocks among transactions running concurrently in a distributed processing network (i.e., a distributed database system). The proposed algorithm is a distributed deadlock detection algorithm. A proof of the correctness of the distributed portion of the algorithm is given, followed by an example of the algorithm in operation. The performance characteristics of the algorithm are also presented.

Deadlock Detection in Distributed Systems

distributed system is a network of sites that exchange informa-< I A tion with each other by message passing. A site consists of computing and storage facilities and an interface to local is a constant users and to a communication network. A primary motivation for using distributed problem, often offsetting systems is the possibility of resource shar-the advantages of resource sharing.

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

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 probe message in each node which is known as memory overhead in the distributed systems.

A safe distributed deadlock resolution algorithm

Journal of Systems Architecture, 1998

Various proposals for Deadlock Detection/Resolution algorithms in distributed systems with AND model have been designed with the purpose of reducing the number of messages involved on detect and resolve deadlocks. The solutions exhibit high degree of liveness but fail in the intuitive safety condition only true deadlocks are resolved. This irregular behaviour of algorithms produces resolutions of false deadlocks, that is, nonexisting or currently being resolved deadlocks. This paper introduces an algorithm free of false deadlock resolutions. The algorithm is probe-based, uses priority of nodes, and stores simple information of messages in order to avoid false deadlocks resolutions. The algorithm is formally proven to verify the safety condition using the Input~Output Automata Model as the basis for the formalism.