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.
Complete list of metadatas

https://hal.inria.fr/hal-01100990
Contributor : Pierre Ramet <>
Submitted on : Wednesday, January 7, 2015 - 3:19:15 PM
Last modification on : Thursday, January 11, 2018 - 6:22:35 AM

Identifiers

  • HAL Id : hal-01100990, version 1

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⟩

Share

Metrics

Record views

370