Abstract
In a computational grid, collective communication methods are inefficient because of heterogeneous network’s features on wide area network. In this paper, we propose the efficient MPI(Message Passing Interface)’s collective communication method in a computational grid on wide area network. The SPPT(Shortest-Path-based Process Tree) algorithm is our proposed algorithm that creates the dynamic-process-tree based on latency information to communicate with each process for efficient collective communication. The experiment shows that the performance of MPI broadcast operation implemented by the SPPT algorithm is higher about 50% and 15% than the Flat-Tree and the HLOT algorithms, respectively, in a grid network which has relatively high latency links.
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.
References
Park, K.L., Lee, H.J., Kwon, O.Y., Park, S.W., Kim, S.D.: Design and Implementation of a Dynamic Communication MPI Library for the Grid. International Journal of Computers and Applications 26(3), 165–172 (2004)
Bernaschi, M., Iannello, G.: Collective Communication Operations: Experimental Results vs. Theory. Concurrency: Practice and Experience, vol 10(3), 359–386 (1998)
Kielmann, T., Hofman, R.F.H., Bal, H.E., Plaat, A., Bhoedjang, R.A.F.: MagPIe: MPI’s Collective Communication Operations for Clustered Wide Area Systems. In: Proc. of Symposium on Principles and Practice of Parallel Programming, pp. 131–140 (1999)
Culler, D., Karp, R., Patterson, D., Sahay, A., Schauers, K.E., Santos, E., Subramonian, R., Von Eicken, T.: LogP: Towards a Realistic Model of Parallel Computation. In: Proc. of Symposium on Principles and Practice of Parallel Programming, pp. 1–13 (1993)
Alexandrov, A., Lonescu, M.F., Schauser, K.E., Scheiman, C.: LogGP: Incorporating Long Messages into the LogP Model – One Step Closer Towards a Realistic Model for Parallel Computation. In: Proc. of Symposium on Parallel Algorithms and Architectures, pp. 95–105 (1995)
Foster, I., Karonis, N.: A grid-enabled MPI: Messaging Passing in Heterogeneous Distributed Computing Systems. In: Proc. of Supercomputing, p. 46 (1998)
Karonis, N., de Supinski, B., Foster, I., Gropp, W., Lusk, E., Bresnahan, J.: Exploiting Hierarchy in Parallel Computer Networks to Optimize Collective Operation Performance. In: Proc. of the International Parallel and Distributed Processing Symposium, pp. 377–386 (2000)
Foster, I., Kesselman, C.: Globus: A Metacomputing Infrastructure Toolkit. International Journal of Supercomputer Applications 11(2), 115–128 (1997)
Message Passing Interface Forum: MPI: A Message-Passing Interface Standard. International Journal of Supercomputer Applications 8(3/4), 165–414 (1994)
Karonis, N., Toonen, B., Foster, I.: MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface. Journal of Parallel and Distributed Computing 63(5), 551–563 (2003)
Wolski, R., Spring, N., Hayes, J.: The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. Journal of Future Generation Computting Systems 15(5-6), 757–768 (1999)
de Supinski, B., Karonis, N.: Accurately Measuring MPI Broadcasts in a Computational Grid. In: Proc. of 8th IEEE Symp. on HPDC 8, April 1999, pp. 29–37 (1999)
Lowekamp, B., Tierney, B., Cottrell, L., Hughes-Jones, R., Kielmann, T., Swany, M.: A Hierarchy of Network Performance Characteristics for Grid Applications and Services, GWD-C Internal Draft, Network Measurements Working Group, Global Grid Forum (2003)
Park, K.L., Lee, H.J., Lee, Y.J., Kwon, O.Y., Park, S.Y., Park, H.W., Kim, S.D.: An Efficient Collective Communication Method for Grid Scale Networks. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2660, pp. 819–828. Springer, Heidelberg (2003)
Dijkstra, E.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)
Prim, R.C.: Shortest Connection Networks and Some Generalizations. Bell System Technical Journal 36, 1389–1401 (1957)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yeom, Y.H., Kwon, S.M., Kim, J.S. (2005). An Efficient Collective Communication Method Using a Shortest Path Algorithm in a Computational Grid. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_37
Download citation
DOI: https://doi.org/10.1007/11590354_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)