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”

Acceleration Techniques for FETI Solvers for GPU Accelerators

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F18%3A10240250" target="_blank" >RIV/61989100:27740/18:10240250 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Acceleration Techniques for FETI Solvers for GPU Accelerators

  • Original language description

    In this paper we evaluate several approaches to performing simultaneous matrix-vector multiplication of large numbers of matrices on a GPU accelerator. The goal of this evaluation is to develop efficient techniques for massively parallel Hybrid Total FETI solvers in our ESPRESO library. FETI solvers generally use sparse matrices. To overcome this we previously proposed the Local Schur Complement method for FETI to convert sparse matrices to their dense representation, without significantly increasing the memory requirements of the GPU accelerator. We selected the following techniques: standard GEMV, CUDA streams, dynamic parallelism, batched GEMM, BSR GEMV and HYB GEMV. Our results show that (i) if a FETI solver contains a large number of small matrices i.e. there is large number of small subdomains, then the best approach is dynamic parallelism; (ii) if there is small number of large subdomains, then the optimal approaches are dynamic parallelism and CUDA streams. Please note that Local Schur Complement method in conjunction with Hybrid Total FETI perform better with smaller subdomains.

  • 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

    <a href="/en/project/LM2015070" target="_blank" >LM2015070: IT4Innovations National Supercomputing Center</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2018

  • 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

    2018 International Conference on High Performance Computing &amp; Simulation (HPCS) : proceedings

  • ISBN

    978-1-5386-7879-4

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    8

  • Pages from-to

    546-553

  • Publisher name

    IEEE

  • Place of publication

    Vienna

  • Event location

    orelans

  • Event date

    Jul 16, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000450677700074