Deadlock

This paper presents a system proposal for preventing, detecting and avoiding deadlocks (PDADL), the system applies some common methods to prevent, detect and avoid deadlock on a local operating system. Moreover, the system simulates all the process and resources on a real operating system. The resources and processes can be detected dynamically from different operations running by real application programs through the operating system. We use Matrix-based algorithm for detecting the deadlock, and Banker's algorithm as well. In addition we made some modifications on the use of avoiding deadlocks in term of, eliminating the circular wait condition which is currently used for preventing deadlocks. We implement an application program named as PDADL to simulate real processes and resources from running operations in a local operating system automatically.

As a powerful analysis tool of Petri nets, reachability trees are
fundamental for systematically investigating many characteristics
such as boundedness, liveness and reversibility. This work proposes
a method to generate a reachability tree, called ωRT for
short, for a class of unbounded generalized nets called
ω-independent nets based on new modified reachability
trees (NMRTs). ωRT can effectively decrease the number of
nodes by removing duplicate and ω-duplicate nodes in the
tree, and verify properties such as reachability, liveness and
deadlocks. Two examples are provided to show its superiority over
NMRTs in terms of tree size.

Citation: Shouguang Wang, Mengdi Gan, Mengchu Zhou, Dan You.
A reduced reachability tree for a class of unbounded Petri nets. IEEE/CAA Journal of Automatica Sinica, 2015, 2(4): 345-352

In a unified transport system, traffic jams and vehicle deadlocks reduce efficiency causing the vehicles involved in it to cease moving. Deadlocks, in particular, halt the flow of vehicles. Therefore, predicting the possibility of a deadlock, identifying it and automatically resolving it are critical to improving lot delivery time. This paper proposes a method to detect a variety of deadlock

Deadlocked international negotiations risk prolonged uncertainty and, worse, the possible onset of hostilities. While the negotiation research literature is replete with strategies and tactics that seek positive sum outcomes, there is a paucity of reliable advice for negotiators faced with stalemate on what they can do to avert failure and get back on the negotiation track. This study suggests that international negotiations can learn from the field of developmental psychology about the concept and practice of resiliency. Resiliency is the human capacity to face, overcome and be strengthened by experiences of extreme adversity. It is a basic and powerful human competency that negotiators, faced with impasse, need to master to avert failure and achieve successful negotiation outcomes. If people have the capacity to bounce back from adversity in their personal lives, negotiators in their professional lives should be able to mobilize this capacity to bounce back from impasses, as well....

This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java programs. Runtime analysis is based on the idea of executing the program once, and observing the generated run to extract various kinds of information. This information can then be used to predict whether other different runs may violate some properties of interest, in addition of course to demonstrate whether the generated run itself violates such properties. These runtime analyses can be performed stand-alone to generate a set of warnings. It is furthermore demonstrated how these warnings can be used to guide a model checker, thereby reducing the search space. The described techniques have been implemented in the home grown Java model checker called Java PathFinder.

A deadlock is reached when multiple processes share the same resource and prevent each other for accessing the resource. Resource organization is considered the optimal solution to solve this problem. This paper presents a novel approach of steady state genetic algorithms hybrid with banker's algorithm. The sequence of operation starts with features extraction that is used for feeding the Genetic algorithm optimizer. The chromosome structure in this method is the one operation processes correlated with three types of genetic operators: The one-point crossover (1X), two point crossover (2X), and Uniform crossover (UX). Observe a large number of optimal solutions that avoids the Dead Lock system as a safe state.

This paper presents an easy and straightforward routing algorithm for WK-Recursive topologies. The algorithm, based on adaptive routing, takes advantage of the geometric properties of such topologies. Once a source node S and destination node D have been determined for a message communication, they characterize, at some level l, two virtual nodes hl vn(SD ) and hl vn(D S ) that respectively contain S but not D and D but not S. Such virtual nodes characterize other N d \Gamma 2 (where N d is the node degree for a fixed topology) virtual nodes hl vn(I SD ) of the same level that contain neither S nor D. Consequently, it is possible to locate N d \Gamma 2 triangles whose vertices are these virtual nodes with the property to share the same path, called the self-routing path, directly connecting hl vn(SD ) to hl vn(D S ). When the self-routing path is unavailable to transmit a message from S to D because of deadlock, fault, and congestion conditions, the routing strategy can follow what ...