Skip to Main content Skip to Navigation
Conference papers

Shared memory parallel algorithms in Scotch 6

François Pellegrini 1, 2 
1 BACCHUS - Parallel tools for Numerical Algorithms and Resolution of essentially Hyperbolic problems
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : The Scotch software package comprises two libraries: the Scotch sequential library, and the PT-Scotch parallel library. The latter is based on a distributed memory paradigm, and uses MPI to exchange data between processes. The advent of many-core, shared memory, machines imposes to reconsider this approach. The complexity of graph partitioning algorithms is low compared to factorization. A first solution is to reduce communication overhead by running graph partitioning only on a limited number of nodes. A second solution is to make graph partitioning algorithms more efficient, by reducing communication overhead and resorting to shared memory parallelism. This talk present our first experiments in this direction.
Complete list of metadata
Contributor : François Pellegrini Connect in order to contact the contributor
Submitted on : Sunday, November 3, 2013 - 8:01:30 PM
Last modification on : Saturday, June 25, 2022 - 7:41:21 PM


  • HAL Id : hal-00879434, version 1



François Pellegrini. Shared memory parallel algorithms in Scotch 6. MUMPS User Group Meeting, May 2013, Clamart, France. ⟨hal-00879434⟩



Record views