766 articles – 1379 references  [version française]
HAL: hal-00410427, version 1

Detailed view  Export this paper
4th International Workshop on Parallel Matrix Algorithms and Applications (PMAA'06), Rennes : France (2006)
PT-Scotch: A tool for efficient parallel graph ordering
Cédric Chevalier 1, François Pellegrini ( ) 1, 2
For the ScAlApplix, INRIA collaboration(s)
(2006-09-07)

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.
1:  SCALAPPLIX (INRIA Futurs)
INRIA – CNRS : UMR5466 – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
2:  Laboratoire Bordelais de Recherche en Informatique (LaBRI)
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II
Computer Science/Distributed, Parallel, and Cluster Computing
Parallel computing – sparse matrix ordering
Attached file list to this document: 
PDF
scotch_parallelordering_pmaa.pdf(98.3 KB)