Strategies for Path-Based Multicasting in Wormhole-Routed Meshes

Eric Fleury 1 Pierre Fraigniaud 2
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 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.
Type de document :
Article dans une revue
Journal of Parallel and Distributed Computing, Elsevier, 1998, 53 (1), pp.26--62
Liste complète des métadonnées

https://hal.inria.fr/inria-00098497
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:02:12
Dernière modification le : jeudi 5 avril 2018 - 12:30:08

Identifiants

  • HAL Id : inria-00098497, version 1

Collections

Citation

Eric Fleury, Pierre Fraigniaud. Strategies for Path-Based Multicasting in Wormhole-Routed Meshes. Journal of Parallel and Distributed Computing, Elsevier, 1998, 53 (1), pp.26--62. 〈inria-00098497〉

Partager

Métriques

Consultations de la notice

232