A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries

François Pellegrini 1, 2, *
* Corresponding author
2 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
Université Bordeaux Segalen - Bordeaux 2, Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : Graph partitioning algorithms have yet to be improved, because graph-based local optimization algorithms do not compute smooth and globally-optimal frontiers, while global optimization algorithms are too expensive to be of practical use on large graphs. This paper presents a way to integrate a global optimization, diffusion algorithm in a banded multi-level framework, which dramatically reduces problem size while yielding balanced partitions with smooth boundaries. Since all of these algorithms do parallelize well, high-quality parallel graph partitioners built using these algorithms will have the same quality as state-of-the-art sequential partitioners
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00301427
Contributor : François Pellegrini <>
Submitted on : Monday, July 21, 2008 - 11:30:14 AM
Last modification on : Tuesday, October 23, 2018 - 5:24:03 PM
Long-term archiving on : Monday, May 31, 2010 - 10:15:20 PM

File

scotch_bipart_diffusion_europa...
Files produced by the author(s)

Identifiers

Citation

François Pellegrini. A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries. EuroPar, Aug 2007, Rennes, France. pp.195-204, ⟨10.1007/978-3-540-74466-5_22⟩. ⟨hal-00301427⟩

Share

Metrics

Record views

469

Files downloads

132