Abstract
The use of an efficient multicast tree can substantially speed up many communication-intensive MPI applications. This is even more crucial for Grid environment since MPI runtime has to work on wide area network with very different and unbalanced network bandwidth. This paper proposes a new and efficient algorithm called, GADT (Genetics Algorithm based Dynamics Tree) that can be used to generate an efficient multicast tree under Grid environment. The algorithm takes into consideration the unbalanced network speed of Grid system in order to generate a multicast tree. The experiments are conducted to compare GADT with binomial tree and optimal algorithm. The results show that GADT can produce a multicast tree that has communication performance close to the optimal multicast tree deriving from exhaustive search. Moreover, the multicast tree generated results in a substantially faster communication than a traditional binomial tree algorithm. Therefore, GADT can be used to speed up the collective operation for MPI runtime system under Grid environment.
This research is supported in part by Kasetsart University Research and Development Institute /SRU Grant and AMD Far East Inc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bernaschi, M., Iannello, G.: Collective Communication Operations: Experimental Results vs. Theory. Concurrency: Practice and Experience 10(5), 359–386 (1998)
Bhat, P.B., Raghavendra, C.S., Prasanna, V.K.: Efficient Collective Communication in Distributed Heterogeneous Systems. In: The International Conference on Distributed Computing Systems (ICDCS), Austin, Texas, pp. 15–24 (1999)
Culler, E.E., Karp, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicke, T.: LogP: Towards a realistic model of parallel computation. In: The 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Dieego, CA, pp. 1–12 (1993)
Foster, I., Kesselman, C.: Globus: A Metacomputing ifrastructure Toolkit. International Journal of Supercomputer Applications 11(2), 115–128 (1997)
Karp, R.M., Sahay, A., Santos, E.E., Schauser, K.E.: Optimal Multicast and Summation in the LogP model. In: Symposium on Parallel Algorithms and Architectures (SPAA), Velen, Germany, pp. 142–153 (1993)
Kielmann, T., Bal, H.E., Gorlatch, S.: Bandwidth-efficient Collective Communication for Clustered Wide Area Systems (1999) (submitted for publication)
Kielmann, T., Bal, H.E., Gorlatch, S., Hofman, R.F.H., Plaat, A., Bhoedjang, R.A.F.: MAGPIE: MPI’s Collective Communication Operations for Clustered Wide Area Systems. In: The Seventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), Atlanta, GA, pp. 131–140 (1999)
Levine, D.: PGAPack Parallel Genetic Algorithm Library, Argonne National Laboratory, ANL95 /18, Argonne, Il (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vorakosit, T., Uthayopas, P. (2003). Generating an Efficient Dynamics Multicast Tree under Grid Environment. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_85
Download citation
DOI: https://doi.org/10.1007/978-3-540-39924-7_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20149-6
Online ISBN: 978-3-540-39924-7
eBook Packages: Springer Book Archive