All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Using full hybrid mesh multiplication for simulations on one million MPI tasks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A10229628" target="_blank" >RIV/61989100:27240/15:10229628 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/15:10229628

  • Result on the web

    <a href="http://dx.doi.org/10.4203/ccp.107.34" target="_blank" >http://dx.doi.org/10.4203/ccp.107.34</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4203/ccp.107.34" target="_blank" >10.4203/ccp.107.34</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Using full hybrid mesh multiplication for simulations on one million MPI tasks

  • Original language description

    Computational Fluid Dynamics (CFD) is one of the fields which can fully utilize the capacity of existing HPC systems. There are many cases either from basic or applied research which are so complex that their numerical simulation requires very fine representation of the computational domain. To tackle some large multi-physics multi-scale problems meshes consisting of hundred billions of cells are necessary. There are several approaches to create such huge meshes. One of them is based on global mesh refinement and is also known as mesh multiplication. Global refinement was already implemented into Code Saturne enhancing its capability in terms of mesh refinement. Meshes with sizes of up to one hundred billion of cells were generated on-the-fly. Since there are many CFD problems where only local area is of interest (either areas close to boundaries, small geometrical entities or in regions with high gradient of solved quantities), local refinement is another approach for mesh generation. In this paper implementation of a parallel local refinement applied to Code Saturne is described. The bottleneck of local adaptive refinement is that it breaks load balancing of the original mesh and requires a lot of global communications. Strategy to repartition the mesh before its refinement is a key issue for optimal resource utilization. To minimize the amount of data transferred among the processor cores it is necessary to do most of the communication during the preprocessing step on the original mesh before refinement. Local mesh refinement strategy was tested and its scalability and performance within Code Saturne were analysed. Results are presented in this paper

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2015

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Civil-Comp proceedings. Volume 107

  • ISBN

    978-1-905088-62-1

  • ISSN

    1759-3433

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    1-13

  • Publisher name

    Civil-Comp Press

  • Place of publication

    Kippen, Stirlingshire

  • Event location

    Dubrovník

  • Event date

    Mar 24, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article