7 citations · 22 across the 8 of their papers we have counts for
3 papers · 1 filter
Scalable High-Quality Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Nikolai Maas +2
Balanced hypergraph partitioning is an NP-hard problem with many applications, e.g., optimizing communication in distributed data placement problems. The goal is to place all nodes…
Scalable Shared-Memory Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders +1
Hypergraph partitioning is an important preprocessing step for optimizing data placement and minimizing communication volumes in high-performance computing applications. To cope wi…
Load-Balanced Bottleneck Objectives in Process Mapping
Johannes Langguth, Sebastian Schlag, Christian Schulz
We propose a new problem formulation for graph partitioning that is tailored to the needs of time-critical simulations on modern heterogeneous supercomputers.