Wednesday 26
Distributed algorithms, multi-agent and parallel computing
Alain Bui
› 12:00 - 12:30 (30min)
› Bât B - TD 31
Current challenges for parallel graph partitioning
François Pellegrini  2, 1@  
2 : BACCHUS  (INRIA Bordeaux - Sud-Ouest)
CNRS : UMR5800, CNRS : UMR5251, PRES Université de Bordeaux, INRIA
1 : Laboratoire Bordelais de Recherche en Informatique  (LaBRI)  -  Website
Université Sciences et Technologies - Bordeaux I, CNRS : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université Victor Segalen - Bordeaux II
Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex -  France

Graph partitioning is a technique used for the solving of many problems in scientific computing, such as the decomposition of a mesh into domains so as to evenly balance the compute load on the processors of a parallel architecture. Because of the ever increasing size of the meshes to handle, partitioning tools themselves had to be parallelized. The parallel versions of these software provide good results for and on several thousands of processors, but the advent of architectures comprising more than a million processing elements raises new problems. Not only do the partitioning results produced by these software have to take into account the heterogeneity of these architectures, but also does the efficient execution of the partitioning software on these architectures require much more sophisticated algorithms. The purpose of this talk is to present the challenges to overcome in order to reach these goals.

Online user: 1