J. Duato, "A new theory of deadlock-free adaptive multicast routing in wormhole networks," in Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, pp. 64--71, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a unicast message always follows a shortest path. The major advantage of this approach is that a single worm can reach an arbitrary set of destinations. Tseng and Panda [10] generalized and improved Lin s approach to accommodate faults and networks that do not necessarily contain HPs, and Duato [11] developed a theory governing the design of adaptive path based multicast routing algorithms. This paper addresses the design of path based multicast communication for wormhole routed torus networks. The symmetry of torus networks leads to a more balanced utilization of communication links, under ....

J. Duato, "A new theory of deadlock-free adaptive multicast routing in wormhole networks," in Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, pp. 64--71, 1993.

....[21] 22] for wormholerouted networks. This scheme is based on finding a Hamiltonian path in the network which is used to establish the dependency relation between resources (e.g. buffers and channels) This allows multiple source multicasts to be performed in a system without deadlock. Duato [12] further studies the use of virtual channels in this scheme in a 2 D mesh to exploit more adaptivity. The limitation of these results is that the network must be Hamiltonian. For irregular networks or networks with faults, the existence of a Hamiltonian path is not guaranteed. Fault tolerance is ....

....paper, we generalize the path based solutions and propose a new trip based model to support multiple multicasts. This model can be applied to any network of arbitrary topology as long as it remains connected. Thus the new model eliminates the limitation associated with the solutions proposed in [12], 21] 22] The underlying concept used in this model is a node sequence called trip. The resource dependency relation is established based on this sequence and the possibility of cyclic dependency [10] and thus deadlock is avoided. The model is supported by adding a certain number of virtual ....

J. Duato. A new theory of deadlock-free adaptive multicast routing in wormhole networks. In Symp. on Parallel and Distri. Processing, pages 64--71, 1993.

....fast collective communication operations by taking advantage of adaptivity. The collective communication algorithms proposed in the literature so far have been geared towards e cube routing. Very little work has been done to take advantage of adaptivity to perform these operations faster. In [14], Duato has presented a theory of deadlock free adaptive multicast routing. A single path based adaptive wormhole routing scheme is proposed in [22] to accommodate both unicast and multicast communication in hypercubes. However, no work has been done to develop communication mechanisms for k ary ....

J. Duato. A New Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks. In Symposium on Parallel and Distributed Processing, pages 64--71, 1993.

....[21, 22] for wormhole routed networks. This scheme is based on finding a Hamiltonian path in the network which is used to establish the dependency relation between resources (e.g. buffers and channels) This allows multiple source multicasts to be performed in a system without deadlock. Duato [12] further studies the use of virtual channels in this scheme in a 2 D mesh to exploit more adaptivity. The limitation of these results is that the network must be Hamiltonian. For irregular networks or networks with faults, the existence of a Hamiltonian path is not guaranteed. Fault tolerance is ....

....paper, we generalize the path based solutions and propose a new trip based model to support multiple multicasts. This model can be applied to any network of arbitrary topology as long as it remains connected. Thus the new model eliminates the limitation associated with the solutions proposed in [12, 21, 22]. The underlying concept used in this model is a node sequence called trip. The resource dependency relation is established based on this sequence and the possibility of cyclic dependency [10] and thus deadlock is avoided. The model is supported by adding a certain number of virtual channels to ....

J. Duato. A new theory of deadlock-free adaptive multicast routing in wormhole networks. In Symp. on Parallel and Distributed Processing, pages 64--71, 1993.

....application of this theory. 3 Deadlock Free Adaptive Multicast Routing This section develops the theoretical background for the design of deadlock free adaptive multicast routing algorithms for networks using wormhole routing. An extended and more formal version of this theory can be found in [15]. 3.1 Assumptions The basic assumptions are an extension of the ones proposed in [14] These assumptions are the following: 1. A node can generate messages destined for any set of nodes at any rate. The set of destination nodes for a message may be split into several ordered subsets at the ....

J. Duato, "A new theory of deadlock-free adaptive multicast routing in wormhole networks," submitted to IEEE Trans. Parallel Distributed Syst.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC