PELLEGRINI, François; HER, Jun-Ho

Métadonnées

Licence d’utilisation du document

PELLEGRINI, François
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

HER, Jun-Ho
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

Langue

Communication dans un congrès

Ce document a été publié dans

SIAM Conference on Parallel Processing for Scientific Computing, 2008-03-12, Atlanta.

Résumé en anglais

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.< Réduire

Mots clés en anglais

parallel graph partitioning

multi-level

recursive bipartitioning

Fiduccia-Mattheyses

URI

https://oskar-bordeaux.fr/handle/20.500.12278/198360

Project ANR

SOLveurs et SimulaTIons en Calculs Extrême - ANR-06-CIS6-0010

Origine

Importé de hal

Unités de recherche

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800