Cause Of Deadlock Research Articles

Control-Flow-Based Methods to Support the Development of Sound Workflows

Workflows describe sequences of tasks to achieve goals. These sequences can contain decisions, loops, and parallelisations and are, therefore, similar to computer programs. Experts in the domain of workflow application usually design these workflows. However, these experts are rarely IT experts. For this reason, after automation by a computer, workflows can exhibit undesired behaviors. Such behaviors can be expensive and dangerous and should be avoided. The notion of soundness describes the absence of the undesired behaviors of deadlocks and abundances. The state of the art in workflow verification can detect such behaviors, but gives no indication of causes, does not provide detailed diagnostic information, or is slow. This article introducēs two new compiler-based techniques to find causes of deadlocks and abundances. These techniques provide detailed diagnostic information and have a cubic asymptotic complexity of runtime. Their efficiency and quality is evaluated using a benchmark of over thousand real-world workflows together with two leading state-of-the-art approaches.

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.

Executive-Legislative Deadlocks in the Dominican Republic

AbstractThis study analyzes the causes of executive-legislative deadlocks in the Dominican Republic in the period 1978–2005. Deadlocks are considered a pernicious element in (presidential) democracies. The study applies a combination of simple statistical techniques and process tracing to test four institutional hypotheses, which argue that certain institutional and party system constellations increase the probability of deadlocks. The hypotheses point to necessary causes of deadlocks, but their predictions are imprecise. Presidents' persuasive powers and coalition building have helped alleviate the deadlock problem. Analysis of the deadlock periods shows that the additional triggering or sufficient causes for deadlocks are either exogenous to the political institutions or related to the instability of coalitions in the nation's nonideological party system, which consists of three almost equal-sized parties.

Asynchronous tree-based multicasting in wormhole-switched MINs

Multicast operation is an important operation in multicomputer communication systems and can be used to support several collective communication operations. A significant performance improvement can be achieved by supporting multicast operations at the hardware level. We propose an asynchronous tree-based multicasting (ATBM) technique for multistage interconnection networks (MINs). The deadlock issues in tree-based multicasting in MINs are analyzed first to examine the main causes of deadlocks. An ATBM framework is developed in which deadlocks are prevented by serializing the initiations of tree operations that have a potential to create deadlocks. These tree operations are identified through a grouping algorithm. The ATBM approach is not only simple to implement but also provides good communication performance using minimal overheads in terms of additional hardware requirements and synchronization delay. Using the ATBM framework, algorithms are developed for both unidirectional and bidirectional multistage interconnection networks. The performances of the proposed algorithms are evaluated through simulation experiments. The results indicate that the proposed hardware-based ATBM scheme reduces the communication latency when compared to the software multicasting approach proposed earlier.

Description and treatment of deadlocks in the Hecodes distributed expert system

The causes of deadlocks in distributed expert systems are examined and classified, and two methods of processing them are proposed. In particular, this problem is discussed within the framework of a working prototype distributed expert system, Hecodes (heterogeneous cooperative distributed expert system) which consists of a control system, a blackboard system, and a group of expert systems whose structures and functions can be different. The two approaches for processing any deadlock are termed deadlock avoidance, and deadlock detection and destruction. Only one of the two can be chosen for a particular run of the system. The detailed working and effects of using each of the proposed deadlock resolution methods are discussed. >