Serial and parallel multilevel graph partitioning using fixed centers

Authors:
Kayhan Erciyeş;Ali Alp;Geoffrey Marshall
Affiliations:
California State University San Marcos, San Marcos, CA;Ege University International Computer Institute, Bornova, İzmir, Turkey;California State University San Marcos, San Marcos, CA
Venue:
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Year:
2005

Citing 4
Cited 0

A cluster-based approach for routing in dynamic networks

ACM SIGCOMM Computer Communication Review
Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing

SIAM Journal on Scientific Computing
Graph partitioning models for parallel computing

Parallel Computing - Special issue on graph partioning and parallel computing
SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs

HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm, it is possible to obtain theoretically and experimentally much more balanced partitions with substantially decreased total edge costs between the partitions than other algorithms. We also developed a parallel method for the fixed centered partitioning algorithm. It is shown that parallel fixed centered partitioning obtains significant speedups compared to the serial case.