The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems involving sparse systems of linear equations of the form A x = b. This report describes a prototype implementation of an out-of-core extension to a parallel multifrontal solver (MUMPS), where disk is used to store data that cannot fit in memory. We show that, by storing the factors to disk, larger problems can be solved on limited-memory machines with reasonable performance. We illustrate the impact of low-level IO mechanisms on the behaviour of our parallel out-of-core factorization. Then we use simulations to analyze the gains that can be expected when also storing the so called active memory on disk. We discuss both the minimum memory requiremen...
Direct methods for the solution of sparse systems of linear equations are used in a wide range of nu...
We consider the solution of very large sparse systems of linear equations on parallel architectures....
While hierarchically low-rank compression methods are now commonly available in both dense and spars...
High performance sparse direct solvers are often a method of choice in various simulation problems. ...
We consider the solution of very large sparse systems of linear equations on parallel architectures....
We study the adaptation of a parallel distributed-memory solver towards a shared-memory code, target...
Factorizing a sparse matrix is a robust way to solve large sparse systems of linear equations. Howev...
Sparse direct solvers using Block Low-Rank compression have been proven efficient to solve problems ...
We consider the solution of large sparse linear systems by means of direct factorization based on a ...
La résolution de systèmes d'équations linéaires creux est au cœur de nombreux domaines d'application...
In the context of this thesis, our focus is on numerical linear algebra, more precisely on solution ...
Scientific applications are usually described as directed acyclic graphs, where nodes represent tas...
Since several years, classical multiprocessor systems have evolved to multicores, which tightly inte...
In the aeronautical industry, aeroacoustics is used to model the propagation of acoustic waves in ai...
The cost of the solution phase in sparse direct methods is sometimes critical. Itcan be larger than ...
Direct methods for the solution of sparse systems of linear equations are used in a wide range of nu...
We consider the solution of very large sparse systems of linear equations on parallel architectures....
While hierarchically low-rank compression methods are now commonly available in both dense and spars...
High performance sparse direct solvers are often a method of choice in various simulation problems. ...
We consider the solution of very large sparse systems of linear equations on parallel architectures....
We study the adaptation of a parallel distributed-memory solver towards a shared-memory code, target...
Factorizing a sparse matrix is a robust way to solve large sparse systems of linear equations. Howev...
Sparse direct solvers using Block Low-Rank compression have been proven efficient to solve problems ...
We consider the solution of large sparse linear systems by means of direct factorization based on a ...
La résolution de systèmes d'équations linéaires creux est au cœur de nombreux domaines d'application...
In the context of this thesis, our focus is on numerical linear algebra, more precisely on solution ...
Scientific applications are usually described as directed acyclic graphs, where nodes represent tas...
Since several years, classical multiprocessor systems have evolved to multicores, which tightly inte...
In the aeronautical industry, aeroacoustics is used to model the propagation of acoustic waves in ai...
The cost of the solution phase in sparse direct methods is sometimes critical. Itcan be larger than ...
Direct methods for the solution of sparse systems of linear equations are used in a wide range of nu...
We consider the solution of very large sparse systems of linear equations on parallel architectures....
While hierarchically low-rank compression methods are now commonly available in both dense and spars...