Concepts for Flexible Parallel Multi-domain Simulations

Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 104)

Abstract

Domain Decomposition methods provide a flexible tool for developing Multi-Physics simulations and coupling different discretization methods. In the DUNE framework different strategies to implement Domain Decomposition methods are available. In general, parallel computations with unrelated meshes pose a major computer science challenge. We discuss an efficient algorithm to relate unrelated distributed meshes in a parallel simulation. For distributed meshes, the necessary coupling information is in general not available locally, which requires the user to use explicit parallel communication. We present an abstraction that hides this non-locality and allows the user to implement his Domain Decomposition strategy in a clear mathematical setting. The mathematical concept admits an easy implementation of a wide range of Domain Decomposition methods, without the necessity to directly deal with the aspects of parallel computations.

Notes

Acknowledgement

This work was supported by the German Research Foundation (DFG) through the Priority Programme 1648 “Software for Exascale Computing” (SPPEXA) and the DFG EXC 1003 Cells in Motion—Cluster of Excellence, Münster, Germany.

References

  1. 1.
    P. Bastian, M. Blatt, A. Dedner, C. Engwer, R. Klöfkorn, R. Kornhuber, M. Ohlberger, O. Sander, A generic grid interface for parallel and adaptive scientific computing. Part II: implementation and tests in DUNE. Computing 82(2–3), 121–138 (2008)MathSciNetMATHGoogle Scholar
  2. 2.
    P. Bastian, G. Buse, O. Sander, Infrastructure for the coupling of dune grids, in Proceedings of ENUMATH 2009 (Springer, Berlin, 2010), pp. 107–114MATHGoogle Scholar
  3. 3.
    C. Bernardi, Y. Maday, A.T. Patera, Domain decomposition by the mortar element method, in Asymptotic and Numerical Methods for Partial Differential Equations with Critical Parameters, ed. by H.G. Kaper, M. Garbey, G.W. Pieper (Springer, The Netherlands, 1993), pp. 269–286CrossRefGoogle Scholar
  4. 4.
    M. Blatt, P. Bastian, On the generic parallelisation of iterative solvers for the finite element method. Int. J. Comput. Sci. Eng. 4(1), 56–69 (2008)CrossRefGoogle Scholar
  5. 5.
    S. Deparis, D. Forti, A. Quarteroni, A rescaled localized radial basis functions interpolation on non-cartesian and non-conforming grids. Technical Report 37.2013, EPFL (2013)Google Scholar
  6. 6.
    M. Gander, C. Japhet, Algorithm 932: PANG: software for non-matching grid projections in 2d and 3d with linear complexity. ACM Trans. Math. Softw. 40(1), 6:1–6:25 (2013)Google Scholar
  7. 7.
    W. Joppich, M. Kürschner, MpCCI – a tool for the simulation of coupled applications. Concurr. Comput. Pract. Exp. 18(2), 183–192 (2006)CrossRefGoogle Scholar
  8. 8.
    S.J. Plimpton, B. Hendrickson, J.R. Stewart, A parallel rendezvous algorithm for interpolation between multiple grids. J. Parallel Distrib. Comput. 64(2), 266–276 (2004)CrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Institute for Computational and Applied MathematicsUniversity of MünsterMünsterGermany
  2. 2.Interdisciplinary Center for Scientific ComputingHeidelberg UniversityHeidelbergGermany

Personalised recommendations