In EDS ansehen

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

Gespeichert in:
Bibliographische Detailangaben
Titel: The PT-Scotch project: purpose, algorithms, first results
Autoren: Chevalier, Cédric, Pellegrini, François
Weitere Verfasser: Pellegrini, François
Verlagsinformationen: 2007.
Publikationsjahr: 2007
Schlagwörter: [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], parallel graph partitioning
Beschreibung: Graph partitioning is an ubiquitous technique which has applications in many fields of computer science and engineering. It is mostly used to help solving domain dependent 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 early results.
Publikationsart: Conference object
Sprache: English
Zugangs-URL: https://hal.science/hal-00410336v1
Dokumentencode: edsair.dedup.wf.002..796e2d924a490b724a8c7f4b4570869f
Datenbank: OpenAIRE
Beschreibung
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 domain dependent 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 early results.