An improved recursive graph bipartitioning algorithm for well balanced domain decomposition - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

An improved recursive graph bipartitioning algorithm for well balanced domain decomposition

Résumé

Nested Dissection has been introduced by A. George and is a well-known and very popular heuristic for sparse matrix ordering to reduce both the fill-in and the operation count during the numerical factorization. Considering now hybrid methods mixing both direct and iterative solvers, obtaining a domain decomposition leading to a good balancing of both the size of domain interiors and the size of interfaces is a key point for load balancing and efficiency in a parallel context. For this purpose, we revisit the algorithm introduced by Lipton, Rose and Tarjan which performed the recursion in a different manner.
Fichier principal
Vignette du fichier
article.pdf (900.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01100962 , version 1 (07-01-2015)

Identifiants

Citer

Astrid Casadei, Pierre Ramet, Jean Roman. An improved recursive graph bipartitioning algorithm for well balanced domain decomposition. IEEE International Conference on High Performance Computing (HiPC 2014), Dec 2014, Goa, India. pp.1-10, ⟨10.1109/HiPC.2014.7116878⟩. ⟨hal-01100962⟩

Collections

CNRS INRIA INRIA2
134 Consultations
289 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More