Add to ORKG(eng) We are concerned with the memory usage of sparse direct solvers. We particularly focus on the influence of state-of-the-art sparse matrix reordering techniques on the dynamic memory usage of a multifrontal solver, MUMPS, and present algorithms to modify the assembly tree traversal that aim at reducing the memory usage. A large number of experiments show the interest of the approach for sequential executions
12 pagesWe study the complexity of traversing tree-shaped workflows whose tasks require large I/O fi...
(eng) High performance sparse direct solvers are often a method of choice in various simulation prob...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
We are concerned with the memory usage of sparse direct solvers. We particula- rly focus on the infl...
We are interested in the memory usage of sparse direct solvers. We particularly focus on the parall...
(eng) The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems....
The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems. This ...
International audienceThe memory usage of sparse direct solvers can be the bottleneck to solve large...
(eng) The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems ...
The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems involv...
Direct methods for the solution of sparse systems of linear equations are used in a wide range of nu...
International audienceHigh performance sparse direct solvers are often a method of choice in various...
(eng) We are interested in the active and total memory usage of the multifrontal method. Starting fr...
High performance sparse direct solvers are often a method of choice in various simulation problems. ...
International audienceWe study the memory scalability of the parallel multifrontal factorization of ...
12 pagesWe study the complexity of traversing tree-shaped workflows whose tasks require large I/O fi...
(eng) High performance sparse direct solvers are often a method of choice in various simulation prob...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
We are concerned with the memory usage of sparse direct solvers. We particula- rly focus on the infl...
We are interested in the memory usage of sparse direct solvers. We particularly focus on the parall...
(eng) The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems....
The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems. This ...
International audienceThe memory usage of sparse direct solvers can be the bottleneck to solve large...
(eng) The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems ...
The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems involv...
Direct methods for the solution of sparse systems of linear equations are used in a wide range of nu...
International audienceHigh performance sparse direct solvers are often a method of choice in various...
(eng) We are interested in the active and total memory usage of the multifrontal method. Starting fr...
High performance sparse direct solvers are often a method of choice in various simulation problems. ...
International audienceWe study the memory scalability of the parallel multifrontal factorization of ...
12 pagesWe study the complexity of traversing tree-shaped workflows whose tasks require large I/O fi...
(eng) High performance sparse direct solvers are often a method of choice in various simulation prob...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...