Deadlock Detection Research Articles

Trace driven dynamic deadlock detection and reproduction

Dynamic analysis techniques have been proposed to detect potential deadlocks. Analyzing and comprehending each potential deadlock to determine whether the deadlock is feasible in a real execution requires significant programmer effort. Moreover, empirical evidence shows that existing analyses are quite imprecise. This imprecision of the analyses further void the manual effort invested in reasoning about non-existent defects. In this paper, we address the problems of imprecision of existing analyses and the subsequent manual effort necessary to reason about deadlocks. We propose a novel approach for deadlock detection by designing a dynamic analysis that intelligently leverages execution traces. To reduce the manual effort, we replay the program by making the execution follow a schedule derived based on the observed trace. For a real deadlock, its feasibility is automatically verified if the replay causes the execution to deadlock. We have implemented our approach as part of WOLF and have analyzed many large (upto 160KLoC) Java programs. Our experimental results show that we are able to identify 74% of the reported defects as true (or false) positives automatically leaving very few defects for manual analysis. The overhead of our approach is negligible making it a compelling tool for practical adoption.

An Approach for Description of Computer Network Defense Scheme and Its Simulation Verification

In order to solve the problem of which the existing defense policy description languages can only describe some aspects of defense, such as protection or detection, but cannot express relationship among actions and to cope with large-scale network attack, we proposed an approach for description of computer network defense scheme and its simulation verification. A computer network defense-oriented scheme description language (CNDSDL) was designed to describe actions of protection (i.e., access control, encryption communication, backup), detection (i.e., intrusion detection, vulnerability detection), analysis (i.e., log auditing), response (i.e., system rebooting, shutdown), recovery (i.e., rebuild, patch making), and relationship among actions (i.e., sequence-and, sequence-or, concurrent-and, concurrent-or, and xor). The Extend Backus-Naur Form (EBNF) of CNDSDL was provided. At last, we provided an implementation mechanism of CNDSDL. A task deadlock detection algorithm was given for the defense scheme. The simulation was completed in simulation platform of GTNetS. Three simulation experiments verified the description capability and effectiveness of CNDSDL. The results of the experiments show that the defense scheme described by CNDSDL can be transformed to detailed technique rules and realize the defense effect of expression.

Simulation and Performance Analysis of a FMS/CIM Using Stochastic Timed Petri Nets

This paper focuses on the modelling, simulation and the performance analysis of a flexible manufacturing system using stochastic timed Petri nets so as to evaluate various performance parameters such as utilization rate of machines, deadlock detection, cycle time, and throughput rate of system in order to obtain the optimum productivity. The simulation of the manufacturing system using Petri nets provides the possibility to view the manufacturing process in time. Petri net model is implemented in Petri Net Toolbox under MATLAB environment. It is achieved the graphic construction of the net. Then, transporting it into a specific mathematical formalism it is made, so that the fulfiled structure to be fully retrieved and used to bring out the internal dynamics of the model. It is validated in this way the net topology, the evolution of (their dynamics), as well as the structural and behavioral properties (corresponding to checking if resources usage is stable and the model have no deadlocks). Some global performance indicators are determined in order to evaluate the performance of the proposed manufacturing system.

An Efficient Local Search for the Feedback Vertex Set Problem

Inspired by many deadlock detection applications, the feedback vertex set is defined as a set of vertices in an undirected graph, whose removal would result in a graph without cycle. The Feedback Vertex Set Problem, known to be NP-complete, is to search for a feedback vertex set with the minimal cardinality to benefit the deadlock recovery. To address the issue, this paper presents NewkLS FVS(LS, local search; FVS, feedback vertex set), a variable depth-based local search algorithm with a randomized scheme to optimize the efficiency and performance. Experimental simulations are conducted to compare the algorithm with recent metaheuristics, and the computational results show that the proposed algorithm can outperform the other state-of-art algorithms and generate satisfactory solutions for most DIMACSbenchmarks.

Unstructured deadlock detection technique with scalability and complexity‐efficiency in clouds

SUMMARYTo detect deadlock in distributed systems, the initiator should construct an efficient explicit or implicit global wait‐for graph. In this paper, we present an unstructured deadlock detection algorithm using a gossip protocol in cloud computing environments, where constituting nodes may join and leave at any time. Because of the inherit properties of a gossip protocol, we argue that our proposed deadlock detection algorithm is scalable, fault‐tolerant, and efficient, retaining safety and liveness properties. The correctness proof of the algorithm is also provided. The message complexity of our proposed algorithm is O(n), where n is the number of nodes. Our performance evaluation with scalable settings shows that our approach has a significant advantage over previous deadlock detection algorithms in terms of solving scalability, fault‐tolerance, and complexity–efficiency issues. Copyright © 2013 John Wiley & Sons, Ltd.

Deadlock Detection Techniques in Distributed Database System

Distributed database system provides resource sharing environment for optimal performance of various database activities, especially when data is spread over a large number of sites. Distributed nature of transactions occurring at different sites and requiring resources from diverse sites pose various operational problems, such as deadlocks, concurrency and data recovery. A deadlock may occur when a transaction enters into wait state which request resource from other blocked transactions. The deadlocks are handled in three phases namely deadlock detection, deadlock avoidance and deadlock detection. Various algorithms have been discussed in the literature for deadlock detection and resolution. These algorithms quite often fail to detect deadlock over distributed database. In this paper an attempt has been made to develop an algorithm for distributed deadlock detection at local and global levels. The author have developed local transaction structure to deal with deadlock at local level and distributed transaction structure at global level

Deadlock Detection and Recovery in Distributed Databases

As the need of distributed processing increases, the complexity in handling of deadlocks also increases. In distributed databases, the conditions for the deadlocks are same as that in centralized but harder to detect, avoid and prevent. Therefore special procedures are required to resolve the deadlock. In this paper we propose a new distributed deadlock detection and recovery algorithm that not only detects deadlock but also resolve them efficiently by aborting less number of transactions. We also present comparative analysis of the proposed algorithm and observed that the proposed algorithm reduces the number of transactions that are to be aborted to resolve the deadlocks, thus improving the performance of the system. General Terms Databases, distributed, deadlocks, detection and resolution.

Deadlock Detection and Avoidance in Static Step Topology under Distributed Environment

During the past years, the distributed computing approach has become very popular due to various advantages over centralized approach. In the distributed approach, the execution of a process has reduced and also it requires low cost for installation. Many of the researchers are using the modeling approach for solution of the software and hardware architecture research problems. The most popular approach of modeling is known as Unified Modeling Language based on the object-oriented technology. In the present work, a method of deadlock detection is explained for the newly proposed static step topology for the distributed network. In the step topology, the processes are taken as a task, sub task, macro, subroutine, etc which are executed in reflexive and symmetric manners when the systems are interconnected to each other under distributed environment and avoidance technique is also presented for the same. The deadlock detection technique is presented through a UML class model.

MPI Runtime Error Detection with MUST: Advances in Deadlock Detection

The widely used Message Passing Interface (MPI) is complex and rich. As a result, application developers require automated tools to avoid and to detect MPI programming errors. We present the Marmot Umpire Scalable Tool (MUST) that detects such errors with significantly increased scalability. We present improvements to our graph-based deadlock detection approach for MPI, which cover future MPI extensions. Our enhancements also check complex MPI constructs that no previous graph-based detection approach handled correctly. Finally, we present optimizations for the processing of MPI operations that reduce runtime deadlock detection overheads. Existing approaches often require 𝒪(p) analysis time per MPI operation, forpprocesses. We empirically observe that our improvements lead to sub-linear or better analysis time per operation for a wide range of real world applications.

Transition-Based Deadlock Detection and Recovery Policy for FMSs Using Graph Technique

A transition-controlled deadlock detection and recovery prevention policy is presented for a subclass of Petri nets used to model flexible manufacturing systems. The subclass is called systems of simple sequential processes with resources (S 3 PR). The proposed policy is different from the standard deadlock prevention policies. Instead of adding control places, this policy adds a controlled transition to solve a group of deadlocked markings that have the same graph-based property. Finally, the results of our study indicate that the proposed policy appears to be more permissive than those existing ones that add control places.

Deriving system behavior from UML state machine diagram: Applied to Missile project

Traditionally, System Analysis and Software Design are treated as separate processes. Software Design is based on System Analysis but they have little direct relationship to each other. UML (Unified Modeling Language) is widely accepted by industry as the de facto standard for System Analysis and Software Design. The primary tool for System Analysis is the Use Case Diagram and its Scenarios, while the primary tools for Software Design are the Class Diagram and Sequence Diagram. State Machine Diagram is also very useful for behavioral modeling. Our aim is to derive system behavior from software design, so that separate processes can work together. This paper suggests how to make a system-wide State Machine Diagram by gathering State Machine Diagrams in the system using predefined Stereotypes and Synchronization/Externalization. The resulting system-wide State Machine Diagram can be used for various things, such as automatic test case generation for the system, deadlock detection, and Use Case scenario consistency checking. The proposed method is applied to the Missile project of ADD (Agency for Defense Development) in South Korea. The result is very promising. It is expected to be applied to more projects.

Design of Liveness-Enforcing Supervisors for S3PR Based on Complementary Places

In this article, an algorithm is proposed to design liveness-enforcing supervisors for systems of simple sequential processes with resources (S 3 PR) based on complementary places. Firstly, a mixed integer programming (MIP) based deadlock detection method is used to find unmarked strict minimal siphons from an infinite-capacity net. Next, the finite-capacity net, in which liveness can be enforced, is obtained by adding capacity function to the infinite-capacity net. Finally, complementary-place transformation is used to transform the finite-capacity net into an infinite-capacity net. This article focuses on adding a complementary place to each operation place that is related to unmarked siphons, deals with the deadlock problem from a new view point, and hence advances the deadlock control theory. Compared with the existing methods, the new policy is easier to implement for real industrial systems. More importantly, design of a complementary-place supervisor is very easy. Finally, in some cases, the new policy can obtain a structurally simpler supervisor with more permissive behavior than the existing methods do. A flexible manufacturing systems (FMS) example is used to compare the proposed policy with some other methods.

Deadlock detection and recovery for component-based systems

Component-based development has gained a lot of attention in recent years. As a software development paradigm, it enhances reusability and reduces complexity but it also brings new challenges in reliability, especially the deadlock problem. In this paper, we present a dynamic probe (DP) strategy for the deadlock problem of component-based systems (CBS). First a formal semantic model is proposed to abstract the interaction among the components for analyzing the deadlock connections, and then the dynamic probe detection (DPD) algorithm is used to detect the deadlock loops. If deadlock connections are detected then the dynamic probe elimination (DPE) algorithm is used to evaluate the component reliability using several measurement indexes to find a component with reliability lower than the other components, and then replace it. Last, in comparison to related work, the results show that the proposed strategy can achieve both lower processing cost and higher reliability.

A Literature Review of Deadlock Prevention Policy Based on Petri Nets for Automated Manufacturing Systems

Deadlock is an undesired situation in a highly automated system due to the fact that no system can allow its occurrence which may produce some unnecessary economic losses or serious consequences. There are three mathematical tools to handle deadlocks in resource allocation systems: graph theory, finite state machine, and Petri net. Due to its inherent characteristics, Petri nets are widely applied to manufacturing systems. Generally, these existing deadlock methods are classified into three strategies: deadlock detection and recovery, deadlock avoidance, and deadlock prevention. In this paper, a review of deadlock prevention policies and merits and drawbacks of these policies are presented. Then it gives the possible trend of the research in the future.

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

A data grid is compose of hundreds of geographically distributed computers and storage resources usually locate under different places and enables users to share data and other resources. Problem statement: Data replication is one of the mechanisms in managing data grid architecture that receive particular attention since it can provide efficient access to data, fault tolerance, reduce access latency and also can enhance the performance of the system. However, during transaction deadlock may occur that can reduce the throughput by minimizing the available resources, so it becomes an important resource management problem in distributed systems. Approach: The Neighbor Replication on Grid Deadlock Detection (NRGDD) transaction model has been developed to handle two deadlock cycle problems on grid. By deploying this method, the transactions communicate with each other by passing the probe messages. The victim message has been used to detect the deadlock when the number of waiting resource by other transaction is highest and become as the cause of deadlock occurs. In addition, this transaction must be aborted to solve the problem. Results: NRGDD transaction model are able to detect and solve more than one cycle of deadlocks. Conclusion: NRGDD has resolve the deadlock problem by sending the minimum number of probes message to detect the deadlock and it can resolve the deadlock to ensure the transaction can be done smoothly.

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.

Deadlock Recovery Technique in Bus Enhanced NOC Architecture

Increase in the speed of processors has led to crucial role of communication in the performance of systems. As a result, routing is taken into consideration as one of the most important subjects of the Network on Chip architecture. Routing algorithms to deadlock avoidance prevent packets route completely based on network traffic condition by means of restricting the route of packets. This action leads to less performance especially in non-uniform traffic patterns. On the other hand True Fully Adoptive Routing algorithm provides routing of packets completely based on traffic condition. However, deadlock detection and recovery mechanisms are needed to handle deadlocks. Use of global bus beside NoC as a parallel supportive environment, provide platform to offer advantages of both features of bus and NoC. This bus is useful for broadcast and multicast operations, sending delay sensitive signals, system management and other services. In this research, we use this bus as an escaping path for deadlock recovery technique. According to simulation results, this bus is suitable platform for deadlock recovery technique.

Analysis of multi-stage open shop processing systems

We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe system states. We show that it is easy to recognize system states that can be reached from the initial state (where the system is empty), but that in general it is hard to decide whether one given system state is reachable from another given system state. We show that the problem of identifying reachable deadlock states is hard in general open shop systems, but is easy in the special case where no job needs processing on more than two machines (by linear programming and matching theory), and in the special case where all machines have capacity one (by graph-theoretic arguments).

Embedded Transitive Closure Network for Runtime Deadlock Detection in Networks-on-Chip

Interconnection networks with adaptive routing are susceptible to deadlock, which could lead to performance degradation or system failure. Detecting deadlocks at runtime is challenging because of their highly distributed characteristics. In this paper, we present a deadlock detection method that utilizes runtime transitive closure (TC) computation to discover the existence of deadlock-equivalence sets, which imply loops of requests in networks-on-chip (NoCs). This detection scheme guarantees the discovery of all true deadlocks without false alarms in contrast with state-of-the-art approximation and heuristic approaches. A distributed TC-network architecture, which couples with the NoC infrastructure, is also presented to realize the detection mechanism efficiently. Detailed hardware realization architectures and schematics are also discussed. Our results based on a cycle-accurate simulator demonstrate the effectiveness of the proposed method. It drastically outperforms timing-based deadlock detection mechanisms by eliminating false detections and, thus, reducing energy wastage in retransmission for various traffic scenarios including real-world application. We found that timing-based methods may produce two orders of magnitude more deadlock alarms than the TC-network method. Moreover, the implementations presented in this paper demonstrate that the hardware overhead of TC-networks is insignificant.

A Review of Distributed Deadlock Detection Techniques based on Diffusion Computation Approach

is a system state in which every process in some group requests resources from other processes in the group, and then waits indefinitely for these requests to be satisfied. Deadlocks have a very adverse effect on the efficient working of operating system therefore they should be either prevented, avoided or if exist should be detected and resolved. Because distributed systems are more vulnerable to deadlocks, the problems of deadlock detection and resolution have long been considered important problems in such systems. This paper provides a comprehensive review of the some of the existing techniques for deadlock detection in distributed environment.