This paper studies the characteristics of synchronous ordering of messages. Synchronous ordering of messages deenes synchronous communication based on the causality relation rather than time. We present the necessary characteristics of any algorithm providing deadlock-free synchronous ordering of the messages. We also present the suucient conditions, based on the causality relations, for any al...

Since network of workstations (NOWs) support for both regular and irregular topologies, designing an efficient deadlock-free routing is a point of concern. In this paper, we take a step toward the goal by developing three novel deadlock-free routing algorithms and covering three known previously reported ones [2, 3] in the body of new family called labelbased routing algorithms for irregular to...

In recent years, there has been a growing concern for robust supervisory control policies that can handle both deadlock and blockage propagation in automated manufacturing systems the event of resource failures. This work proposes novel policy with multiple unreliable resources without using central buffers. The permits legal states as many possible ensures parts not requiring be automatically ...

We present a framework for the incremental construction of deadlock-free systems meeting given safety properties. The framework borrows concepts and basic results from the controller synthesis paradigm by considering a step in the construction process as a controller synthesis problem. We show that priorities are expressive enough to represent restrictions induced by deadlock-free controllers p...

The paper presents a grammar for anisotropic two-dimensional mesh adaptation in hp-adaptive Finite Element Method with rectangular elements. It occurs that a straightforward approach to modeling this process via grammar productions leads to potential deadlock in h-adaptation of the mesh. This fact is shown on a Petri net model of an exemplary adaptation. Therefore auxiliary productions are adde...

Deadlock is the condition of a system that has reached a state in which all of its potential actions are blocked. This paper introduces a deadlock prevention method for discrete events systems modeled by Petri nets. Petri nets have a bipartite graph structure and they are particularly well suited to model concurrencies found in manufacturing, communication and computer systems, among others. Gi...

We consider the problem of static deadlock detection for programs in the Go programming language which make use of synchronous channel communications. In our analysis, regular expressions extended with a fork operator capture the communication behavior of a program. Starting from a simple criterion that characterizes traces of deadlock-free programs, we develop automata-based methods to check f...

This paper examines the problems of deadlock avoidance in multistage networks, and proposes a new class of scalable topologies for constructing large networks without introducing loops that could cause deadlocks. The new topologies, called “fractahedrons,” are deadlock-free and reduce the maximum link contention compared to other networks. The use of fractahedral topologies is illustrated by va...

Specifically, based on the observation that a response is always preceded by a request in multi-processor SoCs, this letter proposes a novel deadlock-free XY-YX router for on-chip network performance improvement. In order to avoid deadlock, we add additional physical channels in the horizontal direction and optimize the priority of output channel allocation. Simulation results show the enhancem...

A fault-tolerant wormhole routing algorithm on meshconnected processors is proposed. The proposed algorithm is based on the solid fault model and allows the fault polygons to be overlapped. The algorithm compares the position of fault region relative to current channel with the fault direction eld of a misrouted message to route around overlapped fault polygons. A node deactivating algorithm to...