International audienceWe are interested in the active and total memory usage of the multifrontal method. Starting from the algorithms proposed by Liu, we suggest a new scheme together with a tree traversal that give an optimal peak of active memory. Significant gains are obtained compared to Liu's approach. We also study the problem of minimizing the total memory and compare various new schemes. A number of experiments shows the interest of these approaches
Achieving optimal throughput by extracting parallelism in behavioral synthesis often exaggerates mem...
International audienceThis paper investigates the execution of tree-shaped task graphs using multipl...
International audienceWe study the memory scalability of the parallel multifrontal factorization of ...
International audienceWe are interested in the active and total memory usage of the multifrontal met...
(eng) We are interested in the active and total memory usage of the multifrontal method. Starting fr...
(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 ...
(eng) We are concerned with the memory usage of sparse direct solvers. We particularly focus on the ...
(eng) We are interested in the memory usage of sparse direct solvers. We particularly focus on the p...
We are concerned with the memory usage of sparse direct solvers. We particula- rly focus on the infl...
International audienceWe present a new scheduling algorithm for task graphs arising from parallel mu...
International audienceScientific applications are usually described as directed acyclic graphs, wher...
International audienceThis paper investigates the execution of tree-shaped task graphs using multipl...
International audienceSparse direct solvers, and in particular multifrontal methods, are widely used...
International audienceHigh performance sparse direct solvers are often a method of choice in various...
Achieving optimal throughput by extracting parallelism in behavioral synthesis often exaggerates mem...
International audienceThis paper investigates the execution of tree-shaped task graphs using multipl...
International audienceWe study the memory scalability of the parallel multifrontal factorization of ...
International audienceWe are interested in the active and total memory usage of the multifrontal met...
(eng) We are interested in the active and total memory usage of the multifrontal method. Starting fr...
(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 ...
(eng) We are concerned with the memory usage of sparse direct solvers. We particularly focus on the ...
(eng) We are interested in the memory usage of sparse direct solvers. We particularly focus on the p...
We are concerned with the memory usage of sparse direct solvers. We particula- rly focus on the infl...
International audienceWe present a new scheduling algorithm for task graphs arising from parallel mu...
International audienceScientific applications are usually described as directed acyclic graphs, wher...
International audienceThis paper investigates the execution of tree-shaped task graphs using multipl...
International audienceSparse direct solvers, and in particular multifrontal methods, are widely used...
International audienceHigh performance sparse direct solvers are often a method of choice in various...
Achieving optimal throughput by extracting parallelism in behavioral synthesis often exaggerates mem...
International audienceThis paper investigates the execution of tree-shaped task graphs using multipl...
International audienceWe study the memory scalability of the parallel multifrontal factorization of ...