A new theory of deadlock-free adaptive routing in wormhole networks

1993 ◽  
Vol 4 (12) ◽  
pp. 1320-1331 ◽  
Author(s):  
J. Duato
Keyword(s):  
Adaptive Routing ◽  
Wormhole Networks

ON THE DESIGN OF DEADLOCK-FREE ADAPTIVE MULTICAST ROUTING ALGORITHMS

1993 ◽  
Vol 03 (04) ◽  
pp. 321-333 ◽  
Author(s):  
JOSÉ DUATO
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Sufficient Conditions ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Multicast Communication ◽  
Adaptive Multicast ◽  
Routing Methods ◽  
Wormhole Networks ◽  
Additional Channel

Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. Two multicast wormhole routing methods have been presented in [13] for multicomputers with 2D-mesh and hypercube topologies. Also, a theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in [7, 8]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. This paper analyses the additional channel dependencies produced by multicast routing algorithms on wormhole networks. Then, the theory proposed in [7, 8] is extended by considering them. As an example, the multicast routing algorithms presented in [13] are extended, taking advantage of the alternative paths offered by the network.

CHANNEL CLASSES: A NEW CONCEPT FOR DEADLOCK AVOIDANCE IN WORMHOLE NETWORKS

1992 ◽  
Vol 02 (04) ◽  
pp. 347-354 ◽  
Author(s):  
JOSÉ DUATO
Keyword(s):  
Adaptive Algorithm ◽  
Adaptive Routing ◽  
Theoretical Background ◽  
Routing Algorithms ◽  
Equivalence Classes ◽  
Deadlock Avoidance ◽  
Previous Theory ◽  
Deadlock Freedom ◽  
Store And Forward ◽  
Wormhole Networks

In previous papers, we have developed the theoretical background for the design of deadlock-free adaptive routing algorithms for store-and-forward and wormhole networks. Some definitions and theorems have been proposed, developing conditions to verify that an adaptive algorithm is deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies have been proposed. In this paper, we propose a partial order between channels as well as an equivalence relation. This relation splits the set of channels into equivalence classes. Then, we extend our previous theory by considering equivalence classes (channel classes) instead of channels. This extension drastically simplifies the verification of deadlock freedom for adaptive routing algorithms with cyclic dependencies between channels. Finally, we present an example.

Sign in / Sign up

Export Citation Format

Share Document