Repository: Freie Universit├Ąt Berlin, Math Department

Engineering a scalable high quality graph partitioner

Holtgrewe, M. and Sanders, P. and Schulz, C. (2010) Engineering a scalable high quality graph partitioner. 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS) . pp. 1-12. ISSN 1530-2075

Full text not available from this repository.

Official URL:


We describe an approach to parallel graph partitioning that scales to hundreds of processors and produces a high solution quality. For example, for many instances from Walshaw's benchmark collection we improve the best known partitioning. We use the well known framework of multi-level graph partitioning. All components are implemented by scalable parallel algorithms. Quality improvements compared to previous systems are due to better prioritization of edges to be contracted, better approximation algorithms for identifying matchings, better local search heuristics, and perhaps most notably, a parallelization of the FM local search algorithm that works more locally than previous approaches.

Item Type:Article
Subjects:Mathematical and Computer Sciences > Computer Science
Divisions:Department of Mathematics and Computer Science > Institute of Computer Science > Algorithmic Bioinformatics Group
ID Code:930
Deposited By: Dipl. Inform. Manuel Holtgrewe
Deposited On:23 Aug 2010 12:49
Last Modified:01 Sep 2010 13:33

Repository Staff Only: item control page