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

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01100962
Contributor : Pierre Ramet <>
Submitted on : Wednesday, January 7, 2015 - 2:51:55 PM
Last modification on : Thursday, January 11, 2018 - 6:22:35 AM
Long-term archiving on : Friday, September 11, 2015 - 1:20:31 AM

File

article.pdf
Files produced by the author(s)

Identifiers

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, ⟨10.1109/HiPC.2014.7116878⟩. ⟨hal-01100962⟩

Share

Metrics

Record views

268

Files downloads

248