Deadlock Detection Methods Research Articles

Instant Multiunit Resource Hardware Deadlock Detection Scheme for System-on-Chips

In this article, a brand new method of determining deadlock is presented. Most previous deadlock detection methods are algorithmic in the sense that they usually leverage some forms of Resource Allocation Graph (RAG) representations and then algorithms are devised to manipulate such representations in order to detect deadlock using information contained in the graph. Different from all previous methods, the proposed method actualizes the RAG with a digital circuit and uses it as a token-transmitting network. By supplying special input signals (tokens) to the network and observing the output tokens from the network, it is easier to identify which process nodes are reachable from each resource node in the graph. Using the reachability information, deadlock can be detected immediately. The time required to obtain the reachability information is determined by how fast the combinational circuit operates. Compared with previous algorithmic methods, the proposed deadlock detection can be deemed instant. We show that the proposed method is an order of magnitude faster than the previous fastest hardware mechanism and several orders of magnitude faster than traditional software-based algorithms.

A Deadlock Detection Method for Inter-organizational Business Process Based on Role Network Model

In the context of inter-organizational business collaboration, structural deadlock detection is an important means of guaranteeing the correctness of an inter-organizational business process model. The existing deadlock detection methods have limitations in handling some aspects of the dynamics and uncertainty arising from inter-organizational nature of the processes. Role Network Model (RNM) was proposed to model knowledge intensive systems and can better represent the dynamic aspects of business processes using roles. But RNM is weak in the explicit description of business processes. Therefore, an extended Directed Acyclic Graph is proposed to better describe the process side complementing RNM. Second, some extended reduction rules targeting process dynamics are proposed to reduce the complexity. Third, a deadlock detection method is proposed to support highly dynamic processes. At both simulation phase and/or run time, deadlock detection and reduction can be performed step by step. The proposed method can not only improve the efficiency of deadlock detection but also find some deadlocks before all the uncertainties are determined. Finally, through a case study, the result demonstrates that this method can effectively achieve deadlock detection for inter-organizational business processes including dynamic and uncertain business processes.

Deadlock detection in multidatabase systems: a performance analysis

Deadlock detection is an interesting problem in multidatabase systems (MDBS), since the autonomy of the local systems precludes the visibility of the state of local transactions and the contention on items, and therefore the classical approaches proposed for homogeneous distributed database systems cannot be extended to the MDBS case. A few specific methods have been proposed in the literature to detect potential global deadlocks, that do not necessarily correspond to real ones. In this paper we present a comparative performance study of several global deadlock detection methods. The results of the analysis have suggested a new hybrid deadlock detection method, that we present in the paper and that is very well suited for a distributed implementation and has a performance that, according to our experiments, compares favourably with all the other methods in a variety of workload conditions.

Evaluating deadlock detection methods for concurrent software

Static analysis of concurrent programs has been hindered by the well-known state explosion problem. Although many different techniques have been proposed to combat this state explosion, there is little empirical data comparing the performance of the methods. This information is essential for assessing the practical value of a technique and for choosing the best method for a particular problem. In this paper, we carry out an evaluation of three techniques for combating the state explosion problem in deadlock detection: reachability searching with a partial-order state-space reduction, symbolic model checking and inequality-necessary conditions. We justify the method used for the comparison, and carefully analyze several sources of potential bias. The results of our evaluation provide valuable data on the kinds of programs to which each technique might best be applied. Furthermore, we believe that the methodological issues we discuss are of general significance in comparison of analysis techniques.

A survey of tasking deadlock detection methods

A survey of tasking deadlock detection methods

Deadlock Detection and Avoidance for Shared Logical Resources

Logical resources are defined as shared passive entities that can be concurrently accessed by multiple processes. Concurrency restrictions depend upon the mode or manner in which a process may manipulate a resource. Models incorporating these single unit resources can be used to analyze information locking for consistency and integrity purposes. Mode compatibility is defined and used to derive dead-lock detection and avoidance methods. These methods generalize well-known deadlock results for single unit resources by permitting greater concurrency while still guaranteeing data consistency. This model is applicable to the standard shared (read-only) and exclusive (read-write) access modes as well as a useful subset of those proposed in the CODASYL DBMS report.