• Aucun résultat trouvé

Towards an automatic generation of dense linear algebra solvers on parallel architectures

N/A
N/A
Protected

Academic year: 2021

Partager "Towards an automatic generation of dense linear algebra solvers on parallel architectures"

Copied!
21
0
0

Texte intégral

Loading

Figure

Figure 1: Overview of the AA-DEMRAL process
Table 1: Configuration space parameters levels
Figure 2: Performance comparaison between LAPACK/MAGMA routines and generated codes via NT2 for general dense linear system solution
Figure 3: Performance results of Generated code on CPU of gels (QR solver) and mcsne

Références

Documents relatifs

This generation of Python bindings is also combined with the automatic generation of pythonic interface (e.g., use of special functions, error translation, memory management and

A Proposal for a Heterogeneous Cluster ScaLAPACK Dense Linear Solvers Vincent Boudet, Fabrice Rastello, Yves Robert.. To cite this version: Vincent Boudet, Fabrice Rastello,

Dense Linear Algebra Kernels on Heterogeneous Platforms: Redistribution Issue Olivier Beaumont, Arnaud Legrand, Fabrice Rastello, Yves Robert.. To cite this version: Olivier

To verify the floating-point solution of a linear system, we adapt floating-point iterative refinements to interval arithmetic [NR]. By using alternately floating-point and

This is not true for runtime systems based on task scheduling by work stealing such as libKOMP, libOMP or XKaapi which have very active threads that consume

One route to the parallel scalable solution of large sparse linear systems in parallel scientific computing is the use of hybrid methods that hierarchically combine direct and

Nowadays, chemists are very familiar with the use of a template to shift an equilibrium in favour of an otherwise non-favoured product. However, to advance the concept from how to

instead of Cutting Plane Method (CPM) may obtain more quick convergence speed, it becomes less effective when dealing with the large-scale training data sets; on the other hand,