Results 1  10
of
29
Distributed Evolutionary Graph Partitioning
, 2012
"... We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a ..."
Abstract

Cited by 27 (13 self)
 Add to MetaCart
We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs in a very short amount of time. For example, in Walshaw’s well known benchmark tables we are able to improve or recompute 76 % of entries for the tables with 1%, 3 % and 5 % imbalance.
Think Locally, Act Globally: Highly Balanced Graph Partitioning
"... We present a novel local improvement scheme for graph partitions that allows to enforce strict balance constraints. Using negative cycle detection algorithms this scheme combines local searches that individually violate the balance constraint into a more global feasible improvement. We combine this ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
We present a novel local improvement scheme for graph partitions that allows to enforce strict balance constraints. Using negative cycle detection algorithms this scheme combines local searches that individually violate the balance constraint into a more global feasible improvement. We combine this technique with an algorithm to balance unbalanced solutions and integrate it into a parallel multilevel evolutionary algorithm, KaFFPaE, to tackle the problem. Overall, we obtain a system that is fast on the one hand and on the other hand is able to improve or reproduce many of the best known perfectly balanced partitioning results reported in the Walshaw benchmark.
Advanced Coarsening Schemes for Graph Partitioning
 IN PROCEEDINGS OF THE 11TH INTERNATIONAL SYMPOSIUM ON EXPERIMENTAL ALGORITHMS (SEA’12), SER. LNCS
, 2012
"... The graph partitioning problem is widely used and studied in many practical and theoretical applications. The multilevel strategies represent today one of the most effective and efficient generic frameworks for solving this problem on largescale graphs. Most of the attention in designing the multi ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
The graph partitioning problem is widely used and studied in many practical and theoretical applications. The multilevel strategies represent today one of the most effective and efficient generic frameworks for solving this problem on largescale graphs. Most of the attention in designing the multilevel partitioning frameworks has been on the refinement phase. In this work we focus on the coarsening phase, which is responsible for creating structurally similar to the original but smaller graphs. We compare different matching and AMGbased coarsening schemes, experiment with the algebraic distance between nodes, and demonstrate computational results on several classes of graphs that emphasize the running time and quality advantages of different coarsenings.
High quality graph partitioning
, 2013
"... We present an overview over our graph partitioners KaFFPa (Karlsruhe Fast Flow Partitioner) and KaFFPaE (KaFFPa Evolutionary). KaFFPa is a multilevel graph partitioning algorithm which on the one hand uses novel local improvement algorithms based on maxflow and mincut computations and more local ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
We present an overview over our graph partitioners KaFFPa (Karlsruhe Fast Flow Partitioner) and KaFFPaE (KaFFPa Evolutionary). KaFFPa is a multilevel graph partitioning algorithm which on the one hand uses novel local improvement algorithms based on maxflow and mincut computations and more localized FM searches and on the other hand uses more sophisticated global search strategies transferred from multigrid linear solvers. KaFFPaE is a distributed evolutionary algorithm to solve the Graph Partitioning Problem. KaFFPaE uses KaFFPa and provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs.
Partitioning Complex Networks via Sizeconstrained Clustering
 in Proceedings of the 13th International Symposium on Experimental Algorithms (SEA’14), ser. LNCS
, 2014
"... Abstract. The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until the graph is small enough to be part ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
(Show Context)
Abstract. The most commonly used method to tackle the graph partitioning problem in practice is the multilevel approach. During a coarsening phase, a multilevel graph partitioning algorithm reduces the graph size by iteratively contracting nodes and edges until the graph is small enough to be partitioned by some other algorithm. A partition of the input graph is then constructed by successively transferring the solution to the next finer graph and applying a local search algorithm to improve the current solution. In this paper, we describe a novel approach to partition graphs effectively especially if the networks have a highly irregular structure. More precisely, our algorithm provides graph coarsening by iteratively contracting sizeconstrained clusterings that are computed using a label propagation algorithm. The same algorithm that provides the sizeconstrained clusterings can also be used during uncoarsening as a fast and simple local search algorithm. Depending on the algorithm’s configuration, we are able to compute partitions of very high quality outperforming all competitors, or partitions that are comparable to the best competitor in terms of quality, hMetis, while being nearly an order of magnitude faster on average. The fastest configuration partitions the largest graph available to us with 3.3 billion edges using a single machine in about ten minutes while cutting less than half of the edges than the fastest competitor, kMetis. 1
Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries
 In Proceedings of EuroPar 2012 Parallel Processing, volume 7484 of LNCS
, 2012
"... Abstract. Computational fluid dynamics (CFD) have become more and more important in the last decades, accelerating research in many different areas for a variety of applications. In this paper, we present an optimized hybrid parallelization strategy capable of solving largescale fluid flow problem ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
Abstract. Computational fluid dynamics (CFD) have become more and more important in the last decades, accelerating research in many different areas for a variety of applications. In this paper, we present an optimized hybrid parallelization strategy capable of solving largescale fluid flow problems on complex computational domains. The approach relies on the combination of lattice Boltzmann methods (LBM) for the fluid flow simulation, octree data structures for a sparse blockwise representation and decomposition of the geometry as well as graph partitioning methods optimizing load balance and communication costs. The approach is realized in the framework of the open source library OpenLB and evaluated for the simulation of respiration in a subpart of a human lung. The efficiency gains are discussed by comparing the results of the full optimized approach with those of more simpler ones realized prior.
Recent advances in graph partitioning
, 2013
"... We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.
Abusing a hypergraph partitioner for unweighted graph partitioning
 CONTEMPORARY MATHEMATICS
, 2013
"... ..."