5 papers
Parallel Unconstrained Local Search for Partitioning Irregular Graphs
Nikolai Maas, Lars Gottesbüren, Daniel Seemaier
We present new refinement heuristics for the balanced graph partitioning problem that break with an age-old rule. Traditionally, local search only permits moves that keep the block…
Linear-Time Multilevel Graph Partitioning via Edge Sparsification
Lars Gottesbüren, Nikolai Maas, Dominik Rosch +2
The current landscape of balanced graph partitioning is divided into high-quality but expensive multilevel algorithms and cheaper approaches with linear running time, such as singl…
KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI
Tim Niklas Uhl, Matthias Schimek, Lukas Hübner +4
The Message-Passing Interface (MPI) and C++ form the backbone of high-performance computing, but MPI only provides C and Fortran bindings. While this offers great language interope…
Tera-Scale Multilevel Graph Partitioning
Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren +1
We present TeraPart, a memory-efficient multilevel graph partitioning method that is designed to scale to extremely large graphs. In balanced graph partitioning, the goal is to div…
Partitioning Trillion Edge Graphs on Edge Devices
Adil Chhabra, Florian Kurpicz, Christian Schulz +2
Processing large-scale graphs, containing billions of entities, is critical across fields like bioinformatics, high-performance computing, navigation and route planning, among othe…