Strategies for Path-Based Multicasting in Wormhole-Routed Meshes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Parallel and Distributed Computing Année : 1998

Strategies for Path-Based Multicasting in Wormhole-Routed Meshes

Résumé

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 multicasting algorithms for the mesh using wormhole routing with the path-based facility. These new algorithms perform generally faster than algorithms previously described in the literature under the same model. We take, as criteria to compare algorithms, the off-line computation time necessary to prepare the multicast, and the communication time to complete the multicast. Moreover, since it is often not possible to derive useful expression for the communication time, we also simulate the algorithms to derive their behavior experimentally.
Fichier non déposé

Dates et versions

inria-00098497 , version 1 (25-09-2006)

Identifiants

  • HAL Id : inria-00098497 , version 1

Citer

Eric Fleury, Pierre Fraigniaud. Strategies for Path-Based Multicasting in Wormhole-Routed Meshes. Journal of Parallel and Distributed Computing, 1998, 53 (1), pp.26--62. ⟨inria-00098497⟩
139 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More