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”

Efficient Implementation of Total FETI Solver for Graphic Processing Units Using Schur Complement

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F16%3A86099005" target="_blank" >RIV/61989100:27230/16:86099005 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27240/16:86099005 RIV/61989100:27740/16:86099005

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007/978-3-319-40361-8_6" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-319-40361-8_6</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-40361-8_6" target="_blank" >10.1007/978-3-319-40361-8_6</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Efficient Implementation of Total FETI Solver for Graphic Processing Units Using Schur Complement

  • Original language description

    This paper presents a new approach developed for acceleration of FETI solvers by Graphic Processing Units (GPU) using the Schur complement (SC) technique. By using the SCs FETI solvers can avoid working with sparse Cholesky decomposition of the stiffness matrices. Instead a dense structure in form of SC is computed and used by conjugate gradient (CG) solver. In every iteration of CG solver a forward and backward substitution which are sequential are replaced by highly parallel General Matrix Vector Multiplication (GEMV) routine. This results in 4.1 times speedup when the Tesla K20X GPU accelerator is used and its performance is compared to a single 16-core AMD Opteron 6274 (Interlagos) CPU. The main bottleneck of this method is computation of the Schur complements of the stiffness matrices. This bottleneck is significantly reduced by using new PARDISO-SC sparse direct solver. This paper also presents the performance evaluation of SC computations for three-dimensional elasticity stiffness matrices. We present the performance evaluation of the proposed approach using our implementation in the ESPRESO solver package.

  • 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)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • 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

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Volume 9611

  • ISBN

    978-3-319-40360-1

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    16

  • Pages from-to

    85-100

  • Publisher name

    Springer

  • Place of publication

    Basel

  • Event location

    Soláň

  • Event date

    May 25, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000386324600006