PT-Scotch: A tool for efficient parallel graph ordering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

PT-Scotch: A tool for efficient parallel graph ordering

Abstract

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.
Fichier principal
Vignette du fichier
scotch_parallelordering_pmaa.pdf (74.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-00410427 , version 1

Cite

Cédric Chevalier, François Pellegrini. PT-Scotch: A tool for efficient parallel graph ordering. 4th International Workshop on Parallel Matrix Algorithms and Applications (PMAA'06), Sep 2006, Rennes, France. ⟨hal-00410427⟩
563 View
145 Download

Share

Gmail Facebook X LinkedIn More