The PT-Scotch project: purpose, algorithms, intermediate results - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

The PT-Scotch project: purpose, algorithms, intermediate results

Résumé

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.
Fichier non déposé

Dates et versions

hal-00410335 , version 1 (20-08-2009)

Identifiants

  • HAL Id : hal-00410335 , version 1

Citer

Cédric Chevalier, François Pellegrini. The PT-Scotch project: purpose, algorithms, intermediate results. PPAM 2007 - Seventh International Conference on Parallel Processing and Applied Mathematics, Sep 2007, Gdansk, Poland. ⟨hal-00410335⟩
65 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More