Sparse

Scheduling for Sparse Solver on Manycore Architectures

The emergence of many-cores architectures introduces variations in computation costs, which makes precise cost models hard to realize. Static schedulers based on cost models, like the one used in the sparse direct solver PaStiX, are no longer …

Sparse direct solvers with accelerators over DAG runtimes

The current trend in the high performance computing shows a dramatic increase in the number of cores on the shared memory compute nodes. Algorithms, especially those related to linear algebra, need to be adapted to these new computer architectures …

Memory Optimization to Build a Schur Complement

Sparse direct solver on top of large-scale multicore systems with GPU accelerators

Toward a supernodal sparse direct solver over DAG runtimes

The current trend in the high performance computing shows a dramatic increase in the number of cores on the shared memory compute nodes. Algorithms, especially those related to linear algebra, need to be adapted to these new computer architectures …

Fine Grain Scheduling for Sparse Solver on Manycore Architectures

The emergence of many-cores architectures introduces variations in computation costs, which makes precise cost models hard to realize. Static schedulers based on cost models, like the one used in the sparse direct solver textscPaStiX, are no longer …

Memory Optimization to Build a Schur Complement in an Hybrid Solver

Sparse direct solvers with accelerators over DAG runtimes

Conception d'un solveur haute performance de systèmes linéaires creux couplant des mt́hodes multigrilles et directes pour la r'ólution des 'eátions de Maxwell 3D en r'egé harmonique discr'eti'́ees ŕ 'el'eńtsínis

Scalable direct and iterative solvers