In this paper, we propose a tree-based multicasting algorithm for Multistage Interconnection Networks. We rst analyze the necessary conditions for deadlocks in MINs. Based on these observations, an asyn-chronous tree-based multicasting algorithm is developed in which deadlocks are prevented by serializing the initiations of branching operations that have potential for creating deadlocks. The se...

A time-out mechanism based on a potential conpici graph has been ap lied i o deiect global deadlocks. In order i o perform t i e time-out mechanism betier, in this paper we propose an optimal vidim selection algorithm for resolving global deadlocks in a muliidaiabase system. The algorithm selects a set of iransaciions urirh the minimal abortion cost to resolve global deadlocks. It makes the use...

It is very common to use dynamic methods to detect deadlocks in MPI programs for the reason that static methods have some restrictions. To guarantee high reliability of some important MPI-based application software, a model of MPI synchronization communication is abstracted and a type of static method is devised to examine deadlocks in such modes. The model has three forms with different comple...

We present a novel dynamic analysis technique that finds real deadlocks in multi-threaded programs. Our technique runs in two stages. In the first stage, we use an imprecise dynamic analysis technique to find potential deadlocks in a multi-threaded program by observing an execution of the program. In the second stage, we control a random thread scheduler to create the potential deadlocks with h...

We introduce the class of weak process dependency relations, and give deenitions of starvation and deadlock cycles in terms of these. We show the usefulness of our deenitions in reasoning about deadlocks, in the general sense of all forms of innnite process suspension, including the local form also known as livelock. In particular, we make a formal distinction between three complementary cases ...

We address the problem of detecting two different kinds of possible deadlocks in Erlang programs using static analysis. Our analysis is completely automatic, fast and effective in detecting deadlocks while avoiding most false alarms. We have integrated our analysis in dialyzer, a widely used tool for detecting software defects in Erlang programs, and demonstrate its effectiveness on open-source...

We propose formal models for coordination functions of the 802.11 MAC layer using systems of communicating machines and analyze them. We model the basic DCF (CSMA/CA) protocol, the DCF protocol with RTS/CTS (MACA), and the PCF protocol. Analyses show the following safety results: the CSMA/CA protocol is free from deadlocks and non-executable transitions, the MACA has a potential livelock, but i...

A novel approach to detection of communication deadlocks in occam 2 programs is proposed. The main feature of the approach is to monitor the interprocess communications of a target occam 2 program at runtime and detect communication deadlocks in the program by operating a Process-Wait-For Graph (PWFG) of the program. The PWFG is a formal representation of the synchronization waiting situation i...

Networks using wormhole switching have traditionally relied upon deadlock avoidance strategies for the design of deadlock-free routing algorithms. More recently, deadlock recovery strategies have begun to gain acceptance. In particular, progressive deadlock recovery techniques are very attractive because they allocate a few dedicated resources to quickly deliver deadlocked packets, instead of k...

This paper considers the architecture of switches. In particular we study how virtual cut-through and wormhole networks can be used as the switch internal interconnect. Introducing such switches into a deadlock free interconnect may give rise to new deadlocks. Previously, to reason that no deadlocks are created, the resulting system was considered globally, that is, the interconnects of the swi...