Parallel Multilevel Algorithms for Multi-constraint Graph Partitioning (Distinguished Paper)

Authors:
Kirk Schloegel;George Karypis;Vipin Kumar
Affiliations:
-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 6
Cited 6

A multilevel algorithm for partitioning graphs

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Multilevel circuit partitioning

DAC '97 Proceedings of the 34th annual Design Automation Conference
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs

SIAM Review
Multilevel algorithms for multi-constraint graph partitioning

SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Dynamic multi-partitioning for parallel finite element applications

Parallel Computing - Linear systems and associated problems

A Matrix Partitioning Interface to PaToH in MATLAB

Parallel Computing
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe

SIAM Journal on Scientific Computing
Computationally efficient solution to the Cahn-Hilliard equation: Adaptive implicit time schemes, mesh sensitivity analysis and the 3D isoperimetric problem

Journal of Computational Physics
Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
On partitioning problems with complex objectives

Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
Workflow Scheduling to Minimize Data Movement Using Multi-constraint Graph Partitioning

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequential multi-constraint graph partitioners have been developed to address the load balancing requirements of multi-phase simulations. The efficient execution of large multi-phase simulations on high performance parallel computers requires that the multi-constraint partitionings are computed in parallel. This paper presents a parallel formulation of a recently developed multi-constraint graph partitioning algorithm. We describe this algorithm and give experimental results conducted on a 128-processor Cray T3E. We show that our parallel algorithm is able to efficiently compute partitionings of similar edge-cuts as serial multi-constraint algorithms, and can scale to very large graphs. Our parallel multi-constraint graph partitioner is able to compute a three-constraint 128-way partitioning of a 7.5 million node graph in about 7 seconds on 128 processors of a Cray T3E.