Strategies for Path-Based Multicasting in Wormhole-Routed Meshes

Abstract

Multicasting is an information dissemination problem which consists, for a processor of a distributed memory parallel computer, in sending the same message to a subset of processors. In this paper, we propose new multicast algorithms for a mesh network usingwormholerouting with apath-basedfacility. These new algorithms generally perform faster than algorithms previously described in the literature under the same model. We used as the criteria for comparing algorithms theoff-line computation timenecessary to prepare the multicast and thecommunication timerequired to complete the multicast.