Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
How Good is Recursive Bisection?
SIAM Journal on Scientific Computing
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM
Parallel Computing - Special issue on graph partioning and parallel computing
Parallel optimisation algorithms for multilevel mesh partitioning
Parallel Computing - Special issue on graph partioning and parallel computing
Multigrid
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
Graph Partitioning and Parallel Solvers: Has the Emperor No Clother? (Extended Abstract)
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Graph partitioning for high-performance scientific simulations
Sourcebook of parallel computing
A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning
Journal of Global Optimization
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Graph minimum linear arrangement by multilevel weighted edge contractions
Journal of Algorithms
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Parallel multilevel algorithms for hypergraph partitioning
Journal of Parallel and Distributed Computing
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Accelerating shape optimizing load balancing for parallel fem simulations by algebraic multigrid
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A parallel shape optimizing load balancer
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Balancing parallel adaptive FEM computations by solving systems of linear equations
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
A shape optimizing load distribution heuristic for parallel adaptive FEM computations
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Analyzing disturbed diffusion on networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Least squares quantization in PCM
IEEE Transactions on Information Theory
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A multilevel algorithm for large unconstrained binary quadratic optimization
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
Graph partitioning requires the division of a graph's vertex set into k equally sized subsets s.t. some objective function is optimized. High-quality partitions are important for many applications, whose objective functions are often NP-hard to optimize. Most state-of-the-art graph partitioning libraries use a variant of the Kernighan-Lin (KL) heuristic within a multilevel framework. While these libraries are very fast, their solutions do not always meet all user requirements. Moreover, due to its sequential nature, KL is not easy to parallelize. Its use as a load balancer in parallel numerical applications therefore requires complicated adaptations. That is why we developed previously an inherently parallel algorithm, called Bubble-FOS/C [H. Meyerhenke, B. Monien, S. Schamberger, Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid, in: Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium, IPDPS'06, IEEE Computer Society, 2006, p. 57 (CD)], which optimizes partition shapes by a diffusive mechanism. However, it is too slow for practical use, despite its high solution quality. In this paper, besides proving that Bubble-FOS/C converges towards a local optimum of a potential function, we develop a much faster method for the improvement of partitionings. This faster method called TruncCons is based on a different diffusive process, which is restricted to local areas of the graph and also contains a high degree of parallelism. By coupling TruncCons with Bubble-FOS/C in a multilevel framework based on two different hierarchy construction methods, we obtain our new graph partitioning heuristic DibaP. Compared to Bubble-FOS/C, DibaP shows a considerable acceleration, while retaining the positive properties of the slower algorithm. Experiments with popular benchmark graphs show that DibaP computes consistently better results than the state-of-the-art libraries METIS and JOSTLE. Moreover, with our new algorithm, we have improved the best known edge-cut values for a significant number of partitionings of six widely used benchmark graphs.