Solving sparse linear systems is a problem that arises in many scientific applications, and sparse direct solvers are a time consuming and key kernel for those applications and for more advanced solvers such as hybrid direct-iterative solvers. For this reason, optimizing their performance on modern architectures is critical. The preprocessing steps of sparse direct solvers, ordering and block-symbolic factorization, are two major steps that lead to a reduced amount of computation and memory and to a better task granularity to reach a good level of performance when using BLAS kernels. With the advent of GPUs, the granularity of the block computation became more important than ever. In this paper, we present a reordering strategy that increas...
International audiencePaStiX is a scientific library that provides a high performance direct superno...
We present implementation details of a reordering strategy for permuting elements whose absolute val...
AbstractCoarse grain parallel codes for solving sparse systems of linear algebraic equations can be ...
International audienceSolving sparse linear systems is a problem that arises in many scientific appl...
Solving sparse linear systems is a problem that arises in many scientific applications, and sparse d...
International audienceAmong the preprocessing steps of a sparse direct solver, reordering and block ...
International audienceIn the context of solving sparse linear systems, an ordering process partition...
International audienceWhen solving large sparse linear systems, both the amount of memory needed and...
Solving sparse linear systems is a problem that arises in many scientific applications, and sparse d...
The present work presents a strategy to increase the arithmetic intensity of the solvers. Namely, we...
In this "Habilitation à Diriger des Recherches" (HDR), we present our research in high-performance s...
Texte intégral accessible uniquement aux membres de l'Université de LorraineThis dissertation treats...
International audienceScientific applications very often rely on solving one or more linear systems....
Through the recent improvements toward exascale supercomputer systems, huge computations can be perf...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
International audiencePaStiX is a scientific library that provides a high performance direct superno...
We present implementation details of a reordering strategy for permuting elements whose absolute val...
AbstractCoarse grain parallel codes for solving sparse systems of linear algebraic equations can be ...
International audienceSolving sparse linear systems is a problem that arises in many scientific appl...
Solving sparse linear systems is a problem that arises in many scientific applications, and sparse d...
International audienceAmong the preprocessing steps of a sparse direct solver, reordering and block ...
International audienceIn the context of solving sparse linear systems, an ordering process partition...
International audienceWhen solving large sparse linear systems, both the amount of memory needed and...
Solving sparse linear systems is a problem that arises in many scientific applications, and sparse d...
The present work presents a strategy to increase the arithmetic intensity of the solvers. Namely, we...
In this "Habilitation à Diriger des Recherches" (HDR), we present our research in high-performance s...
Texte intégral accessible uniquement aux membres de l'Université de LorraineThis dissertation treats...
International audienceScientific applications very often rely on solving one or more linear systems....
Through the recent improvements toward exascale supercomputer systems, huge computations can be perf...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
International audiencePaStiX is a scientific library that provides a high performance direct superno...
We present implementation details of a reordering strategy for permuting elements whose absolute val...
AbstractCoarse grain parallel codes for solving sparse systems of linear algebraic equations can be ...