Abstract
In this paper, we evaluate the performance of domain decomposition applications with message-passing in GRID environments. We compare two domain decomposition strategies, the balanced and the unbalanced one. The balanced strategy is the normal strategy used in homogenous computing environment. This strategy present some problems related with the heterogeneous communications in a grid environment. We propose an unbalanced domain decomposition strategy in order to overlap the slow communications with computation. The influence of the communication patterns on execution times is analysed. DIMEMAS simulator is used to predict the performance of distributed applications in GRID environments.
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
Dimemas, Internet (October 2002), http://www.cepba.upc.es/dimemas/ (Tool documentation)
Badia, R.M., Labarta, J., Giménez, J., Escale, F.: DIMEMAS: Predicting MPI applications behavior in Grid environments. In: Workshop on Grid Applications and Programming Tools (GGF8) (2003)
Badia, R.M., Escale, F., Gabriel, E., Gimenez, J., Keller, R., Labarta, J., Müller, M.S.: Performance Prediction in a Grid Environment. In: 1st European Across Grid Conference, Santiago de Compostela (2003)
Paraver, Internet (October 2002), http://www.cepba.upc.es/paraver/ (Instrumentation packages)
George, K., Vipin, K.: Multilevel Algorithms for Multi-Constraint Graph Partitioning. University of Minnesota, Department of Computer Science/Army HPC Research Center. Minneapolis. MN 55455. Technical Report #98-019 (1998)
George, K., Vipin, K.: Multilevel k-way Partitioning Schemefor Irregular Graphs. University of Minnesota, Department of Computer Science/Army HPC Research Center. Minneapolis. MN 55455. Technical Report #95-064. To appear in SIAM Journal of Parallel and Distributed Computing (1998)
George, K., Vipin, K.: A fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. University of Minnesota, Department of Computer Science/Army HPC Research Center. Minneapolis. MN 55455. Technical Report #95-035 (1998), To appear in SIAM on Scientific Computing
Metis, Internet, http://www.cs.umn.edu/~metis
Keyes, D.E.: Domain Decomposition Methods in the Mainstream of Computational Science. In: Proceedings of the 14th International Conference on Domain Decomposition Methods, pp. 79–93. UNAM Press, Mexico City (2003)
Cai, X.C.: Some Domain Decomposition Algorithms for Nonselfadjoint Elliptic and Parabolic Partial Differential Equations. Technical Report 461, Courant Institute, New York (1989)
Kaushik, D.K., Keyes, D.E., Smith, B.F.: On the Interaction of Architecture and Algorithm in the Domain-based Parallelization of an Unstructured Grid Incompressible Flow Code. In: Mandel, J., et al. (eds.) Proceedings of the 10th International Conference on Domain Decomposition Methods, pp. 311–319. Wiley, Chichester (1997)
Gropp, W.D., Kaushik, D.K., Keyes, D.E., Smith, B.F.: Latency, bandwidth, and concurrent issue limitations in high-performance CFD. In: Proceedings of the First M.I.T. Conference on Computational Fluid and Solid Mechanics, Cambridge, MA, June 2001, pp. 839–841 (2001)
Gropp, W.D., Keyes, D.E.: Complexity of Parallel Implementation of Domain Decomposition Techniques for Elliptic Partial Differential Equations. SIAM Journal on Scientific and Statistical Computing 9(2), 312–326 (1988)
García, F., Calderón, A., Carretero, J.: MiMPI: A Multithread-Safe Implementation of MPI. In: Margalef, T., Dongarra, J., Luque, E. (eds.) PVM/MPI 1999. LNCS, vol. 1697, pp. 207–214. Springer, Heidelberg (1999)
Karonis, N., Toonen, B., Foster, I.: Mpich-g2: A Grid-enabled implementation of the message passing interface. Accepted for publication in Journal of Parallel and Distributed Computing (2003)
Keller, R., Gabriel, E., Krammer, B., Müller, M.S., Resch, M.M.: Towards efficient execution of MPI applications on the Grid: Porting and Optimization issues. Journal of Grid Computing 1(2), 133–149 (2003)
Ranganathan, K., Foster, I.: Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications. In: Proceedings of the 11th International Symposium for High Performance Distributed Computing (HPDC 11), Edinburgh (July 2002)
Deelman, E., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Vahi, K., Blackburn, K., Lazzarini, A., Arbree, A., Cavanaugh, R., Koranda, S.: Mapping Abstract Complex Workflows onto Grid Environments. Journal of Grid Computing 1(1), 25–39 (2003)
Lamenhamedi, H., Szymanski, B., Shentu, Z.: Data Replication Strategies in Grid Environments. In: Fifth International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2002), Beijing, China, October 23-25 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otero, B., Cela, J.M., Badia, R.M., Labarta, J. (2004). A Domain Decomposition Strategy for GRID Environments. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2004. Lecture Notes in Computer Science, vol 3241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30218-6_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-30218-6_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23163-9
Online ISBN: 978-3-540-30218-6
eBook Packages: Springer Book Archive