Deadlocks are an important issue in the design of interconnection networks. A successful approach is to restrict the routing function such that it satisfies a necessary and sufficient condition for deadlock-free routing. Typically, such a condition states that some (extended) dependency graph must be acyclic. Defining and proving such a condition is complex. Proving that a routing function sati...

Transition refinement and subnet abstraction are key approaches to realize modularization and hierarchical modeling in a Petri nets model; using these two methods, the Petri nets based structural design becomes possible. Model transforming technologies using a kind of transition subnet – the engineering subnet, are presented in this paper; the operations of subnet abstraction and transition ref...

This paper presents a novel concept of multi-drop path-based multidestination message passing on switch-based irregular networks. First, the multi-drop mechanism is deened with an associated header encoding scheme, and this mechanism is used to develop path-based multidestination worms. Next, a method is proposed to identify valid multidestination paths on arbitrary irregular networks with a ty...

The order-(m, n) hyper-deBruijn graph HD(m,n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally important subgraphs and admit efficient implementat...

Development of wormhole routing tech niques so far has been largely independent of the re sults available for store and forward routing in litera ture In this paper we provide a general result which enables us to design deadlock free wormhole routing algorithms from store and forward routing algorithms that satisfy certain criteria We illustrate this re sult by developing fully adaptive deadloc...

The order-(m,n) hyper-deBruijn graph H D ( m , n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally imponant subgraphs and admit efficient implemen...

In this paper we propose a flow control algorithm for k-ary n-cube networks which avoids the deadlock problems without using virtual channels. Some basic definitions and theorems are proposed in order to establish the necessary and sufficient conditions to verify that an algorithm is deadlock-free. Our proposal is based on a restriction of the virtual cut-through flow control rather than of the...

Adaptation of a component-based system can be achieved in the coordination modelling language Paradigm through the special component McPal. McPal regulates the propagation of new behaviour and guides the changes in the components and in their coordination. Here we show how McPal may delegate part of its control to local adaptation managers, created on-the-fly, allowing for distribution of the a...

Virtual circuits can reduce the routing overhead with irregular topologies and provide support for a mix of quality of service (QOS) requirements. Information about the state of the network and expected traffic patterns may be used during circuit establishment to utilize network resources more efficiently than is practical with packet routing. Most virtual circuit schemes are static — once the ...

Virtual circuits can reduce routing overheads with irregular topologies and provide support for a mix of quality of service (QOS) requirements. Information about network loads and traffic patterns may be used during circuit establishment to utilize network resources more efficiently than is practical with packet routing. Most virtual circuit schemes are static — each established virtual circuit...