Broadcasting in wraparound meshes with parallel monodirectional links - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Parallel Computing Année : 1992

Broadcasting in wraparound meshes with parallel monodirectional links

Résumé

In this paper we give an algorithm to broadcast a message in a wraparound mesh distributed-memory parallel architecture with parallel monodirectional links. This algorithm uses a general strategy based on the diffusion of the message in edge-disjoint spanning trees. We first present in this setting the results of Saad and Schultz and the improvements obtained by Simmen. We then give an asymptotically optimal broadcasting algorithm improving the preceding results. It uses in the wraparound mesh the constructions of two edge-disjoint spanning trees rooted at a given node and of minimum depth.
Fichier principal
Vignette du fichier
91-BMT92-broaadcasting-meshes .pdf (2.46 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03203497 , version 1 (20-04-2021)

Identifiants

Citer

Jean-Claude Bermond, Philippe Michallon, Denis Trystram. Broadcasting in wraparound meshes with parallel monodirectional links. Parallel Computing, 1992, 18 (6), pp.639-648. ⟨10.1016/0167-8191(92)90004-Q⟩. ⟨hal-03203497⟩
38 Consultations
31 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More