 |
 |
 |
|
|
|
| HAL: hal-00700053, version 1 |
| See detailed view |  BibTeX,EndNote,... |
 |
| Available versions | v1 (2012-05-22) | v2 (2012-05-25) |
|
|
|
|
| Memory Optimization to Build a Schur Complement in an Hybrid Solver |
|
|
| Casadei Astrid 1, 2Pierre Ramet 1, 2 |
|
|
| (2012) |
|
|
|
| Solving linear system $Ax=b$ in parallel where $A$ is a large sparse matrix is a very recurrent problem in numerical simulations. One of the state-of-the-art most promising algorithm is the hybrid method based on domain decomposition and Schur complement. In this method, a direct solver is used as a subroutine on each subdomain matrix. This approach is subject to serious memory overhead. In this paper, we investigate new techniques to reduce memory consumption during the build of the Schur complement by a direct solver. Our method allows memory peak reduction from 10% to 30% on each processus for typical test cases. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 2: | BACCHUS (INRIA Bordeaux - Sud-Ouest) |
|
|
|
INRIA – Université de Bordeaux – CNRS : UMR5800 |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Numerical Analysis Computer Science/Distributed, Parallel, and Cluster Computing |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00700053, version 1 | |
| http://hal.inria.fr/hal-00700053 | |
| oai:hal.inria.fr:hal-00700053 | |
| From: Pierre Ramet | |
| Submitted on: Tuesday, 22 May 2012 13:49:51 | |
| Updated on: Tuesday, 22 May 2012 14:01:25 | |
