Improved bounds for gossiping in mesh bus networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Interconnection Networks Année : 2000

Improved bounds for gossiping in mesh bus networks

Résumé

Improved bounds for the minimum gossiping time in mesh bus networks of arbitrary dimension for 1-port model are given. More precisely, the gossiping protocol consists of steps during which messages are sent via buses and at the end of the protocol, all the nodes should know all the information. Furthermore, during one step a bus can carry at most one message, and each node can either send or receive (not both) on at most one bus The minimum gossiping time of a bus network G is the minimum number of steps required to perform a gossip under this model. Here we determine almost exactly the minimum gossip time for 2-dimensional mesh bus networks and give tight bounds for d-dimensional mesh bus networks.
Fichier principal
Vignette du fichier
126-BMY00-gossipingmesh.pdf (218.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03764772 , version 1 (30-08-2022)

Identifiants

Citer

Jean-Claude Bermond, Susan Marshall, Min-Li Yu. Improved bounds for gossiping in mesh bus networks. Journal of Interconnection Networks, 2000, 01 (1), pp.1-19. ⟨10.1142/S0219265900000020⟩. ⟨hal-03764772⟩
13 Consultations
33 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More