Y.-C. Tseng and D. K. Panda, "Trip-based multicasting in wormhole-routed networks," in Proceedings of the 7th International Parallel Processing Symposium, (Newport Beach, CA), pp. 276--283, April 1993. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Path-Based Multicast Communication in Wormhole-Routed.. - Robinson, McKinley.. (1997) (1 citation) (Correct)
....cyclic dependences and deadlock. Messages may follow shortcuts in order to reduce path length, in particular, to guarantee that 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 ....
Y.-C. Tseng and D. K. Panda, "Trip-based multicasting in wormhole-routed networks," in Proceedings of the 7th International Parallel Processing Symposium, (Newport Beach, CA), pp. 276--283, April 1993.
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