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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barchet-Steffenel, L.A., Mounie, G.: Scheduling heuristics for efficient broadcast operations on grid environments. In: IPDPS (2006)
Barnett, M., Payne, D.G., van de Geijn, R.A., Watts, J.: Broadcasting on meshes with wormhole routing. J. Parallel Distrib. Comput. 35(2), 111–122 (1996)
Bhat, P.B., Raghavendra, C.S., Prasanna, V.K.: Efficient collective communication in distributed heterogeneous systems. J. Parallel Distrib. Comput. 63(3), 251–263 (2003)
Foster, I., Karonis, N.: A grid-enabled MPI: Message passing in heterogeneous distributed computing systems. In: Proceedings of SC 1998. ACM Press, New York (1998)
Hsu, C.-H., Tsai, B.-R.: Scheduling for atomic broadcast operation in heterogeneous networks with one port model. The Journal of Supercomputing 50(3), 269–288 (2009)
Kielmann, T., Bal, H., Gorlatch, S., Verstoep, K., Hofman, R.: Network performance-aware collective communication for clustered wide area systems. Parallel Computing 27(11), 1431–1456 (2001)
Tatsuhiro, C., Toshio, E., Satochi, M.: High-performance mpi. In: IPDPS (2004)
Kodama, Y., Takano, R., Matsuda, M., Kudoh, T., Ishikawa, Y.: Efficient mpi collective operations for clusters in long-and-fast networks. In: Cluster 2006 (2006)
Matsuda, M., Kudoh, T., Tazuka, H., Ishikawa, Y.: The design and implementation of an asynchronous communication mechanism for the MPI communication model. In: CLUSTER, pp. 13–22. IEEE Computer Society, Los Alamitos (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fkaier, H., Cérin, C., Steffenel, L.A., Jemni, M. (2010). A New Heuristic for Broadcasting in Cluster of Clusters. In: Bellavista, P., Chang, RS., Chao, HC., Lin, SF., Sloot, P.M.A. (eds) Advances in Grid and Pervasive Computing. GPC 2010. Lecture Notes in Computer Science, vol 6104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13067-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-13067-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13066-3
Online ISBN: 978-3-642-13067-0
eBook Packages: Computer ScienceComputer Science (R0)