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”

Highly scalable FETI methods in ESPRESO

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F15%3A86099018" target="_blank" >RIV/61989100:27740/15:86099018 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27230/15:86099018

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Highly scalable FETI methods in ESPRESO

  • Original language description

    This paper describes our new hybrid parallelization of the Finite Element Tearing and Interconnecting (FETI) method for the multi-socket and multi-core computer clusters. This is an essential step in our development of the Hybrid FETI solver were a small number of neighboring subdomains is aggregated into clusters and each cluster is processed by a single compute node. In our previous work the FETI solver was implemented using MPI parallelization into our ESPRESO solver. The proposed hybrid implementation provides better utilization of resources of modern HPC machines using advanced shared memory runtime systems such as Cilk++ runtime. Cilk++ is an alternative to OpenMP which is used by the ESPRESO for shared memory parallelization. We have compared the performance of the hybrid parallelization to MPI-only parallelization. The results show that we have reduced both solver runtime and memory utilization. This allows the solver to use a larger number of smaller sub-domains and in order to solve larger problems using a limited number of compute nodes. This feature is essential for users with smaller computer clusters.

  • 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

    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

    neuvedeno

  • Number of pages

    13

  • Pages from-to

    "nestrankovano"

  • 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