Sparse

PaStiX 5

Parallel Sparse Direct Solver

PaStiX 6

Parallel Sparse Direct Solver

SPM

SParse Matrix Package

Study of the recent developments around the PaStiX solver for the EoCoE project: distributed mem- ory, runtime systems, and low-rank

As the core of a large number of simulation tools, the resolution of large linear systems often represents the dominant part of the computing time. Massively parallel versions are needed to maintain advances in multi-physics and multi-scale …

Heterogeneous architectures, Hybrid methods, Hierarchical matrices for Sparse Linear Solvers

Exploiting Modern Manycore Architecture in Sparse Direct Solver with Runtime Systems

Sparse direct solvers is a time consuming operation required by many scientific applications to simulate physical problems. By its important overall cost, many studies tried to optimize the time to solution of those solvers on multi-core and …

Impact of Blocking Strategies for Sparse Direct Solvers on Top of Generic Runtimes

Among the preprocessing steps of a sparse direct solver, reordering and block symbolic factorization are two major steps to reach a suitable granularity for BLAS kernels efficiency and runtime management. In this talk, we present a reordering …

Sparse Supernodal Solver Using Hierarchical Compression over Runtime System

In this talk, we present the PaStiX sparse supernodal solver, using hierarchical compression to reduce the burden on large blocks appearing during the nested dissection process. We compare the numerical stability, and the performance in terms of …

Reordering Strategy for Blocking Optimization in Sparse Linear Solvers

Exploiting Kepler architecture in sparse direct solver with runtime systems

Sparse direct solvers is a time consuming operation required by many scientific applications to simulate physical problems. By its important overall cost, many studies tried to optimize the time to solution of those solvers on multi-core and …