Efficient and scalable parallel graph partitioning

François Pellegrini 1, 2 Jun-Ho Her 1, 2
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 : The realization of efficient parallel graph partitioners requires the parallelization of the multi-level framework which is commonly used in sequential partitioners to improve quality and speed. While parallel matching algorithms are now efficient and un-biased enough to yield coarsened graphs of good quality, the local optimization algorithms used in the refinement step of the uncoarsening process are still an issue. This talk will present the results obtained to date in the PT-Scotch project regarding k-way graph partitioning and parallel static mapping. We will show how parallel diffusive method can advantageously replace classical (and purely sequential) Fiduccia-Mattheyses-like algorithms for local optimization, as well as the specific algorithmic problems posed by static mapping.
Complete list of metadatas

Contributor : François Pellegrini <>
Submitted on : Wednesday, August 19, 2009 - 8:51:51 PM
Last modification on : Tuesday, October 23, 2018 - 5:24:06 PM


  • HAL Id : hal-00410329, version 1


François Pellegrini, Jun-Ho Her. Efficient and scalable parallel graph partitioning. 5th International Workshop on Parallel Matrix Algorithms and Applications (PMAA'08), Jun 2008, Neuchâtel, Switzerland. ⟨hal-00410329⟩



Record views