Towards efficient and scalable graph partitioning methods

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 during uncoarsening are still an issue. This talk will address this problem and present scalable parallel diffusive methods which can advantageously replace classical Fiduccia-Mattheyses-like algorithms for this purpose.
Complete list of metadatas
Contributor : François Pellegrini <>
Submitted on : Thursday, August 20, 2009 - 12:18:30 AM
Last modification on : Tuesday, October 23, 2018 - 5:24:06 PM


  • HAL Id : hal-00410330, version 1


François Pellegrini, Jun-Ho Her. Towards efficient and scalable graph partitioning methods. SIAM Conference on Parallel Processing for Scientific Computing, Mar 2008, Atlanta, United States. ⟨hal-00410330⟩



Record views