CHEVALIER, Cédric; PELLEGRINI, François

Métadonnées

Licence d’utilisation du document

CHEVALIER, Cédric
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

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

Langue

Communication dans un congrès

Ce document a été publié dans

4th International Workshop on Parallel Matrix Algorithms and Applications (PMAA'06), 2006-09-07, Rennes.

Résumé en anglais

Graph partitioning is an ubiquitous technique which has applications in many fields of computer science and engineering. Because there always exists large problem graphs which cannot fit in the memory of sequential computers and cost too much to partition, parallel graph partitioning tools have been developed. Graph ordering is the first target application of the PT-Scotch (“Parallel Threaded Scotch”) software, a parallel extension of the sequential Scotch graph partitioning and ordering tool that we are currently developing within the ScAlApplix project. We outline in this extended abstract the algorithms which we have implemented in PT-Scotch to parallelize the Nested Dissection ordering method.< Réduire

Mots clés en anglais

Parallel computing

sparse matrix ordering

URI

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

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