CHEVALIER, Cédric; PELLEGRINI, François

Metadatos

Licencia de uso del documento

CHEVALIER, Cédric
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

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

Idioma

Communication dans un congrès

Este ítem está publicado en

PPAM 2007 - Seventh International Conference on Parallel Processing and Applied Mathematics, 2007-09-09, Gdansk.

Resumen en inglés

Graph partitioning is an ubiquitous technique which has applications in many fields of computer science and engineering. It is mostly used to help solving optimization problems modeled in terms of weighted or unweighted graphs, where finding good solutions amounts to computing, eventually recursively in a divide-and-conquer framework, small vertex or edge cuts that balance evenly the weights of the graph parts. 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. PT-Scotch is another attempt to provide a simple and efficient library for parallel graph partitioning and ordering. We present in this paper the main research topics that we want to cover in this project in order to achieve our goals, as well as some midterm results regarding parallel graph ordering.< Leer menos

Palabras clave en inglés

PT-Scotch

parallel sparse matrix ordering

URI

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

Proyecto ANR

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

Orígen

Importado de Hal

Centros de investigación

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