Optimal Deadlock-free Path-based Multicast Algorithms in Meshes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1998

Optimal Deadlock-free Path-based Multicast Algorithms in Meshes

Johanne Cohen
Eric Fleury
  • Fonction : Auteur

Résumé

Multicasting is an information dissemination problem which consists, for a node of a distributed memory parallel computer, of sending the same message to an arbitrary subset of nodes. The two major criteria to be considered in multicast communication are \textsl{traffic} (number of channels used) & \textsl{latency} (time required). In this paper, we proposed new polynomial algorithms giving optimal solutions in terms of traffic or latency for a mesh network using \textsl{wormhole} routing & \textsl{path-based} facility. All the algorithms are shown to be deadlock-free. Moreover, we generalize our algorithms to arbitrary Hamiltonian graphs.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00098443 , version 1

Citer

Vincent Bouchitte, Johanne Cohen, Eric Fleury. Optimal Deadlock-free Path-based Multicast Algorithms in Meshes. 5th International Colloquium on Structural Information & Communication Complexity (SIROCCO'98), 1998, Amalfi, Italy, 17 p. ⟨inria-00098443⟩
57 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More