Skip to main content

Performance Analysis of Domain Decomposition Applications Using Unbalanced Strategies in Grid Environments

  • Conference paper
Grid and Cooperative Computing - GCC 2005 (GCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3795))

Included in the following conference series:

Abstract

In this paper, we compare the performance of some mesh-based applications in a Grid environment using the domain decomposition technique and unbalanced workload strategies. We propose unbalanced distributions in order to overlap computation with remote communications. Results are presented for typical cases in car crashing simulation where finite element schemes are applied in fine mesh. The expected execution time is basically the same when two unbalanced techniques are used, but it is up 34% smaller that the one requires by the classical balanced strategy. We also analyze the influence of the communication pattern on execution times using the Dimemas simulator.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Taylor, V.E., Holmer, B.K., Schwabe, E.J., Hribar, M.R.: Balancing Load versus Decreasing Communication: Exploring the Tradeoffs. HICSS 1, 585–593 (1996)

    Google Scholar 

  2. Berger, M., Bokhari, S.: A partitioning strategy for non-uniform problems on multiprocessors. IEEE Transactions on Computers C-36, 5 (1997)

    Google Scholar 

  3. Simon, H.D., Sohn, A., Biswas, R.: Harp: A fast spectral partitioner. In: 9th ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island (1997)

    Google Scholar 

  4. Gropp, W.D., Kaushik, D.K., Keyes, D.E., Smith, B.F.: Latency, Bandwidth, and Concurrent Issue Limitations in High-Performance CFD. In: Conference on Computational Fluid and Solid Mechanics, Cambridge, MA, pp. 839–841 (2001)

    Google Scholar 

  5. Otero, B., Cela, J.M., Badia, R.M., Labarta, J.: A Domain Decomposition Strategy for GRID Environments. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J. (eds.) EuroPVM/MPI 2004. LNCS, vol. 3241, pp. 353–361. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Dimemas. Internet (2002), http://www.cepba.upc.es/tools/dimemas/

  7. Girona, S., Labarta, J., Badía, R.M.: Validation of Dimemas communication model for MPI collective operations. In: Dongarra, J., Kacsuk, P., Podhorszki, N. (eds.) PVM/MPI 2000. LNCS, vol. 1908, p. 39. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. 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 (2003)

    Google Scholar 

  9. Badia, R.M., Escale, F., Gabriel, E., Giménez, J., Keller, R., Labarta, J., Müller, M.S.: Performance Prediction in a Grid Environment. In: 1st European across Grid Conference (2003)

    Google Scholar 

  10. Badía, R.M., Escalé, F., Giménez, J., Labarta, J.: DAMIEN: D5.3/CEPBA. IST-2000-25406

    Google Scholar 

  11. Badía, R.M., Giménez, J., Labarta, J., Escalé, F., Keller, R.: DAMIEN:D5.2/CEPBA.IST-2000-25406

    Google Scholar 

  12. http://clik.to/adslvelocidad

  13. http://www.bandwidthplace.com/speedtest

  14. Bjørndalen, J.M., Anshus, O.J., Vinter, B., Larsen, T.: The Impact on Latency and Bandwidth for a Distributed Shared Memory System Using a Gigabit Network Supporting the Virtual Interface Architecture. NIK 2000, Norsk Informatikk Konferanse, Bodø, Norway (2000)

    Google Scholar 

  15. Wolman, A., Voelker, G.M., Sharma, N., Cardwell, N., Karlin, A., Levy, H.M.: On the scale and performance of cooperative Web proxy caching. In: Proceedings of the seventeenth ACM symposium on Operating systems principles, pp. 16–31. ACM Press, New York (1999)

    Chapter  Google Scholar 

  16. Keyes, D.E.: Domain Decomposition Methods in the Mainstream of Computational Science. In: 14th International Conference on Domain Decomposition Methods, Mexico, pp. 79–93 (2003)

    Google Scholar 

  17. Metis, Internet, http://www.cs.umn.edu/~metis

  18. Frisch, N., Rose, D., Sommer, O., Ertl, T.: Visualization and pre-processing of independent finite element meshes for car crash simulations. The Visual Computer 18(4), 236–249 (2002)

    Article  Google Scholar 

  19. Sosnowski, W.: Flow approach-finite element model for stamping processes versus experiment. Computer Assisted Mechanics and Engineering Sciences 1, 49–75 (1994)

    Google Scholar 

  20. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otero, B., Cela, J.M., Badía, R.M., Labarta, J. (2005). Performance Analysis of Domain Decomposition Applications Using Unbalanced Strategies in Grid Environments. 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_125

Download citation

  • DOI: https://doi.org/10.1007/11590354_125

  • 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)

Publish with us

Policies and ethics