An improved recursive graph bipartitioning algorithm for well balanced domain decomposition

Astrid Casadei 1, 2 Pierre Ramet 1, 2 Jean Roman 1, 2
Abstract : 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.
Type de document :
Communication dans un congrès
IEEE International Conference on High Performance Computing (HiPC 2014), Dec 2014, Goa, India. pp.1-10, 2014, 〈10.1109/HiPC.2014.7116878〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01100962
Contributeur : Pierre Ramet <>
Soumis le : mercredi 7 janvier 2015 - 14:51:55
Dernière modification le : jeudi 11 janvier 2018 - 06:22:35
Document(s) archivé(s) le : vendredi 11 septembre 2015 - 01:20:31

Fichier

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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, 2014, 〈10.1109/HiPC.2014.7116878〉. 〈hal-01100962〉

Partager

Métriques

Consultations de la notice

193

Téléchargements de fichiers

125