Sciweavers

PPSC
1997

A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm

14 years 1 months ago
A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latency. The multilevel k-way partitioning algorithm reduces the size of the graph by successively collapsing vertices and edges (coarsening phase), finds a k-way partitioning of the smaller graph, and then it constructs a k-way partitioning for the original graph by projecting and refining the partition to successively finer graphs (uncoarsening phase). Our algorithm is able to achieve a high degree of concurrency, while maintaining the high quality partitions produced by the serial algorithm.
George Karypis, Vipin Kumar
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 1997
Where PPSC
Authors George Karypis, Vipin Kumar
Comments (0)