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”

An approach for parallel loading and pre-processing of unstructured meshes stored in spatially scattered fashion

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F19%3A10243796" target="_blank" >RIV/61989100:27740/19:10243796 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/8820782" target="_blank" >https://ieeexplore.ieee.org/document/8820782</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/IPDPS.2019.00084" target="_blank" >10.1109/IPDPS.2019.00084</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    An approach for parallel loading and pre-processing of unstructured meshes stored in spatially scattered fashion

  • Original language description

    This paper presents a workflow for parallel loading of database files containing sequentially stored unstructured meshes that are not considered to be efficiently read in parallel. In such a file consecutive elements are not spatially located and their respective nodes are at unknown positions in the file. This makes parallel loading challenging since adjacent elements are on different MPI processes, and their respective nodes are on unknown MPI processes. These two facts lead to a high communication overhead and very poor scalability if not addressed properly. In a standard approach, a sequentially stored mesh is sequentially converted to a particular parallel format accepted by a solver. This represents a significant bottleneck. Our proposed algorithm demonstrates that this bottleneck can be overcome, since it is able to (i) efficiently recreate an arbitrary stored sequential mesh in the distributed memory of a supercomputer without gathering the information into a single MPI rank, and (ii) prepare the mesh for massively parallel solvers. (C) 2019 IEEE

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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

    2019

  • 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

    Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium, IPDPS 2019

  • ISBN

    978-1-72811-246-6

  • ISSN

  • e-ISSN

    1530-2075

  • Number of pages

    12

  • Pages from-to

    749-760

  • Publisher name

    Institute of Electrical and Electronics Engineers Inc.

  • Place of publication

    Rio de Janeiro

  • Event location

    Rio de Janeiro

  • Event date

    May 20, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article