Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition

Astrid Casadei 1, 2 Pierre Ramet 1, 2 Jean Roman 1, 2
Abstract : In the context of hybrid sparse linear solvers based on domain decomposition and Schur complement approaches, getting a domain decomposition tool leading to a good balancing of both the internal node set size and the interface node set size is a critical point for parallel computation. We propose several variations of the existing algorithms in the multilevel Scotch partitioner and we illustrate the improved results on a collection of graphs coming from numerical scientific applications.
Type de document :
Communication dans un congrès
Mini-Symposium on "Combinatorial Issues in Sparse Matrix Computation" at ICIAM'15 conference, Aug 2015, Beijing, China
Liste complète des métadonnées

https://hal.inria.fr/hal-01100990
Contributeur : Pierre Ramet <>
Soumis le : mercredi 7 janvier 2015 - 15:19:15
Dernière modification le : jeudi 11 janvier 2018 - 06:22:35

Identifiants

  • HAL Id : hal-01100990, version 1

Collections

Citation

Astrid Casadei, Pierre Ramet, Jean Roman. Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition. Mini-Symposium on "Combinatorial Issues in Sparse Matrix Computation" at ICIAM'15 conference, Aug 2015, Beijing, China. 〈hal-01100990〉

Partager

Métriques

Consultations de la notice

330