A new heuristic for broadcasting in clusters of clusters - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A new heuristic for broadcasting in clusters of clusters

Résumé

This paper deals with the problem of broadcasting for clus- ter of clusters. The construction of partial minimum spanning trees being NP-complete, several heuristic algorithms have been already formulated. Many of these heuristics (like the heuristic of Kruskal) use the shortest path to connect the components of the tree. They are not relevant in case of forwarding or overlapping communication during a step of the algorithm. In this paper, we study a new heuristic for the minimum broadcasting tree and we evaluate it through simulations with different communication parameters and also through real experimentation over the Grid'5000 testbed.
Fichier principal
Vignette du fichier
article.pdf (179.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00510837 , version 1 (28-08-2010)

Identifiants

  • HAL Id : hal-00510837 , version 1

Citer

Hazem Fkaier, Christophe Cérin, Luiz Angelo Steffenel, Mohamed Jemni. A new heuristic for broadcasting in clusters of clusters. 5th International Conference on Grid and Pervasive Computing (GPC 2010), May 2010, Hualien, Taiwan. ⟨hal-00510837⟩
178 Consultations
106 Téléchargements

Partager

Gmail Facebook X LinkedIn More