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”

Intel Xeon Phi acceleration of Hybrid Total FETI solver

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F17%3A10237059" target="_blank" >RIV/61989100:27230/17:10237059 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27240/17:10237059 RIV/61989100:27740/17:10237059

  • Result on the web

    <a href="http://www.sciencedirect.com/science/article/pii/S0965997816302745?via%3Dihub" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0965997816302745?via%3Dihub</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.advengsoft.2017.05.001" target="_blank" >10.1016/j.advengsoft.2017.05.001</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Intel Xeon Phi acceleration of Hybrid Total FETI solver

  • Original language description

    This paper describes an approach for acceleration of the Hybrid Total FETI (HTFETI) domain decomposition method using the Intel Xeon Phi coprocessors. The HTFETI method is a memory bound algorithm which uses sparse linear BLAS operations with irregular memory access pattern. The presented local Schur complement (LSC) method has regular memory access pattern, that allows the solver to fully utilize the Intel Xeon Phi fast memory bandwidth. This translates to speedup over 10.9 of the HTFETI iterative solver when solving 3 billion unknown heat transfer problem (3D Laplace equation) on almost 400 compute nodes. The comparison is between the CPU computation using sparse data structures (PARDISO sparse direct solver) and the LSC computation on Xeon Phi. In the case of the structural mechanics problem (3D linear elasticity) of size 1 billion DOFs the respective speedup is 3.4. The presented speedups are asymptotic and they are reached for problems requiring high number of iterations (e.g., ill-conditioned problems, transient problems, contact problems). For problems which can be solved with under hundred iterations the local Schur complement method is not optimal. For these cases we have implemented sparse matrix processing using PARDISO also for the Xeon Phi accelerators.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

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)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2017

  • 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

  • Name of the periodical

    Advances in Engineering Software

  • ISSN

    0965-9978

  • e-ISSN

  • Volume of the periodical

    112

  • Issue of the periodical within the volume

    10 May 2017

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    12

  • Pages from-to

    124-135

  • UT code for WoS article

    000405456900011

  • EID of the result in the Scopus database

    2-s2.0-85019158745