The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1996 vol.7)
pp: 138-150
ABSTRACT
<p><b>Abstract</b>—This paper focuses on efficient multicasting in wormhole-routed networks. A <it>trip-based model</it> is proposed to support adaptive, distributed, and deadlock-free <it>multiple multicast</it> on any network with arbitrary topology using at most two virtual channels per physical channel. This model significantly generalizes the path-based model proposed earlier [<ref rid="bibl013821" type="bib">21</ref>], [<ref rid="bibl013822" type="bib">22</ref>], which works only for Hamiltonian networks and cannot be applicable to networks with arbitrary topology resulted due to system faults. Fundamentals of the trip-based model, including the necessary and sufficient condition to be deadlock-free, and the use of appropriate number of virtual channels to avoid deadlock are investigated. The potential of this model is illustrated by applying it to hypercubes with faulty nodes. Simulation results indicate that the proposed model can implement multiple multicast on faulty hypercubes with negligible performance degradation.</p>
INDEX TERMS
Routing algorithm, interprocessor communication, multicast, virtual channel, wormhole-routing, path-based routing, collective communication, fault tolerance.
CITATION
Yu-Chee Tseng, Dhabaleswar K. Panda, Ten-Hwang Lai, "A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels", IEEE Transactions on Parallel & Distributed Systems, vol.7, no. 2, pp. 138-150, February 1996, doi:10.1109/71.485503
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool