A new heuristic for broadcasting in cluster of clusters

Authors:
Hazem Fkaier;Christophe Cérin;Luiz Angelo Steffenel;Mohamed Jemni
Affiliations:
,Unité de recherche UTIC/ESSTT, Bab Mnara, Tunis, Tunisia;LIPN, UMR 7030, CNRS, Université Paris-Nord, Villetaneuse, France;Département de Mathématiques et Informatique, Université de Reims Champagne-Ardenne CReSTIC - Équipe SysCom, REIMS CEDEX 2, France;Unité de recherche UTIC/ESSTT, Bab Mnara, Tunis, Tunisia
Venue:
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Year:
2010

Citing 7
Cited 0

Broadcasting on meshes with wormhole routing

Journal of Parallel and Distributed Computing
A grid-enabled MPI: message passing in heterogeneous distributed computing systems

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Network performance-aware collective communication for clustered wide-area systems

Parallel Computing - Clusters and computational grids for scientific computing
Efficient collective communication in distributed heterogeneous systems

Journal of Parallel and Distributed Computing
The design and implementation of an asynchronous communication mechanism for the MPI communication model

CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
Scheduling for atomic broadcast operation in heterogeneous networks with one port model

The Journal of Supercomputing
Scheduling heuristics for efficient broadcast operations on grid environments

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the problem of broadcasting for cluster 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.