Recently, wormhole routers with multidestination capability have been proposed to support fast multicast in a multicomputer network. To avoid communication deadlock, existing results have proposed to construct a Hamilton path, Euler path, trip, or their variants in the network, perhaps with some degree of support of virtual channels [1], [14], [15], [18], [23]. In this paper, we identify that a network which is itself Eulerian or is Eulerian after some links are removed, can enjoy the multidestination capability without support of virtual channels. From this definition, we then develop several techniques to achieve fault-tolerant multicast in a torus/mesh of any dimension with regular fault patterns (such as single node, block, L-shape, T-s...
Routing on a two-dimensional torus architecture by means of the wormhole routing algorithm is introd...
A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been ...
Abstract—A technique to enhance multicomputer routers for fault-tolerant routing with modest increas...
. We describe fault-tolerant routing of multicast messages in mesh-based wormhole-switched multicomp...
This paper focuses on efficient multicasting in wormhole-routed networks. A trip-based model is prop...
The existing algorithms for deadlock-free multicasting in interconnection networks assume the Hamilt...
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of th...
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-toleran...
[[abstract]]©2003 World Scientific Publishing-In wormhole meshes, many a routing algorithm prevents ...
. We show that deadlocks due to dependencies on consumption channels is a fundamental problem in mul...
© 2002 IEEE. This paper describes a fault-tolerant broadcast algorithm for wormhole-routed torus net...
This paper proposes a novel concept of multidestination worm mechanism which allows a message to be ...
[[abstract]]©2003-A routing algorithm able to tolerate two faulty blocks with a distance of two, no ...
A fault-tolerant wormhole routing algorithm in mesh multicomputer is proposed, which enables two goo...
Efficient routing of messages is the key to the performance of multicomputers. Multicast communicati...
Routing on a two-dimensional torus architecture by means of the wormhole routing algorithm is introd...
A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been ...
Abstract—A technique to enhance multicomputer routers for fault-tolerant routing with modest increas...
. We describe fault-tolerant routing of multicast messages in mesh-based wormhole-switched multicomp...
This paper focuses on efficient multicasting in wormhole-routed networks. A trip-based model is prop...
The existing algorithms for deadlock-free multicasting in interconnection networks assume the Hamilt...
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of th...
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-toleran...
[[abstract]]©2003 World Scientific Publishing-In wormhole meshes, many a routing algorithm prevents ...
. We show that deadlocks due to dependencies on consumption channels is a fundamental problem in mul...
© 2002 IEEE. This paper describes a fault-tolerant broadcast algorithm for wormhole-routed torus net...
This paper proposes a novel concept of multidestination worm mechanism which allows a message to be ...
[[abstract]]©2003-A routing algorithm able to tolerate two faulty blocks with a distance of two, no ...
A fault-tolerant wormhole routing algorithm in mesh multicomputer is proposed, which enables two goo...
Efficient routing of messages is the key to the performance of multicomputers. Multicast communicati...
Routing on a two-dimensional torus architecture by means of the wormhole routing algorithm is introd...
A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been ...
Abstract—A technique to enhance multicomputer routers for fault-tolerant routing with modest increas...