License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-20914
URL: https://drops.dagstuhl.de/opus/volltexte/2009/2091/
Go to the corresponding Portal


Pellegrini, Francois

Distillating knowledge about SCOTCH

pdf-format:
09061.PellegriniFrancois.Paper.2091.pdf (0.2 MB)


Abstract

The design of the Scotch library for static mapping, graph
partitioning and sparse matrix ordering is highly modular,
so as to allow users and potential contributors to tweak it
and add easily new static mapping, graph bipartitioning,
vertex separation or graph ordering methods to match their
particular needs.

The purpose of this tutorial is twofold. It will start with a
description of the interface of Scotch, presenting its visible
objects and data structures.
Then, we will step into the API mirror and have a look at the inside:
the internal representation of graphs, mappings and orderings, and the
basic sequential and parallel building blocks: graph induction, graph
coarsening which can be re-used by third-party software. As an
example, we will show how to add a simple genetic algorithm routine to
the graph bipartitioning methods.

BibTeX - Entry

@InProceedings{pellegrini:DSP:2009:2091,
  author =	{Francois Pellegrini},
  title =	{Distillating knowledge about SCOTCH},
  booktitle =	{Combinatorial Scientific Computing},
  year =	{2009},
  editor =	{Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo},
  number =	{09061},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2091},
  annote =	{Keywords: Scotch, graph algorithms, data structures}
}

Keywords: Scotch, graph algorithms, data structures
Collection: 09061 - Combinatorial Scientific Computing
Issue Date: 2009
Date of publication: 24.07.2009


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI