The PT-Scotch project: purpose, algorithms, intermediate results
CHEVALIER, Cédric
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
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]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
CHEVALIER, Cédric
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
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]
< Reduce
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Language
en
Communication dans un congrès
This item was published in
PPAM 2007 - Seventh International Conference on Parallel Processing and Applied Mathematics, 2007-09-09, Gdansk.
English Abstract
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 ...Read more >
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.Read less <
English Keywords
PT-Scotch
parallel sparse matrix ordering
ANR Project
SOLveurs et SimulaTIons en Calculs Extrême - ANR-06-CIS6-0010
Origin
Hal imported