We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adap-tive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the rst deadlock-free adaptive multicast wormhole routing algorith...

It has been shown in [8,9] that the e-cube or priorIn this work, we consider deadlock-free routing in Hyitized dimension routing for hypercubes is deadlock free percycles which are class of multidimensional graphs since the resources are ordered and there are no cycles. In used for modeling interconnection networks. Hypercyecube, a lower order link cannot be issued unless a higher cles offer si...

In this dissertation, we consider deadlock freedom as a behavioral correctness criterion of service interaction and accordingly classify two different notions of well-designed update of a service : q Equivalence : a service S’ is an equivalent update of a service S S and S’ have exactly the same set of deadlock-free partners q Accordance : a service S’ is an accordant update of a service S ever...

We study a class of examples of minimizing automata with respect to branching bisimulation in the context of the Span(Graph) model. Compositional minimization is particularly efficient for the class which includes the classical dining philospher problem and variants. The reason for the efficiency is that finite subsets of the class generate finite submonoids of the bisimulation monoid. We indic...

Dynamic reconfiguration of interconnection networks is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge is in avoiding deadlock anomalies while keeping restrictions on packet injection and forwarding minimal. Current approaches fall in one of two categories. Either they require the existence of extra network res...

In massively parallel computers, processors are often connected in a hypercube configuration. Each vertex in the hypercube represents a processor, and each edge represents a communication link. One problem in such a system is avoiding deadlock, a state where there is a cycle of processors, each waiting on the next indefinitely. A second problem is that in a system with many processors, some are...

The concept of hierarchical networks is useful for designing a large heterogeneous NoC by reusing predesigned small NoCs as subnets. It can also be helpful when analyzing and designing a large NoC as interconnection of subnets at a higher level of abstraction. Hierarchical deadlock-free routing is required to enable deadlock-free interconnection of sub-networks with different internal routing a...

In control theory, the usual notion of causality-that, at all times, a system's output (action) only depends on its past and present inputs (observations)-presupposes that all inputs and outputs can be ordered, a priori, in time. In reality, many distributed systems (those subject to deadlock, for instance), are not sequential in this sense. between a less restrictive notion of causality, deadl...

There is a seemingly endless miniaturization of electronic components, which has enabled designers to build sophisticated computing structures on silicon chips. Consequently, electronic systems are continuously improving with new and more advanced functionalities. Design complexity of these Systems on Chip (SoC) is reduced by the use of pre-designed cores. However, several problems related to t...

This paper presents a deadlock-free cooperation protocol for an object-sorting task in a multi-agent system. First, the object-sorting task in a distributed robotic system is introduced and a cooperation protocol for the task along with the agent architecture is proposed. The agents are based on a homogeneous agent architecture that consists of search, motion, and communication modules coordina...