Zobrazeno 1 - 10
of 39
pro vyhledávání: '"SCHLAG, SEBASTIAN"'
Autor:
Ajwani, Deepak, Bisseling, Rob H., Casel, Katrin, Çatalyürek, Ümit V., Chevalier, Cédric, Chudigiewitsch, Florian, Faraj, Marcelo Fonseca, Fellows, Michael, Gottesbüren, Lars, Heuer, Tobias, Karypis, George, Kaya, Kamer, Lacki, Jakub, Langguth, Johannes, Li, Xiaoye Sherry, Mayer, Ruben, Meintrup, Johannes, Mizutani, Yosuke, Pellegrini, François, Petrini, Fabrizio, Rosamond, Frances, Safro, Ilya, Schlag, Sebastian, Schulz, Christian, Sharma, Roohani, Strash, Darren, Sullivan, Blair D., Uçar, Bora, Yzelman, Albert-Jan
Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gain new insights about our surroundings. Even if the final application c
Externí odkaz:
http://arxiv.org/abs/2310.11812
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 across $k$ different blocks of bounded size, such that hyperedges spa
Externí odkaz:
http://arxiv.org/abs/2303.17679
Autor:
Çatalyürek, Ümit V., Devine, Karen D., Faraj, Marcelo Fonseca, Gottesbüren, Lars, Heuer, Tobias, Meyerhenke, Henning, Sanders, Peter, Schlag, Sebastian, Schulz, Christian, Seemaier, Daniel, Wagner, Dorothea
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last decade in practical algorithms for balanced (hyper)graph partitioning together with futur
Externí odkaz:
http://arxiv.org/abs/2205.13202
Autor:
Schlag, Sebastian, Heuer, Tobias, Gottesbüren, Lars, Akhremtsev, Yaroslav, Schulz, Christian, Sanders, Peter
This paper considers the balanced hypergraph partitioning problem, which asks for partitioning the vertices into $k$ disjoint blocks of bounded size while minimizing an objective function over the hyperedges. Here, we consider the most commonly used
Externí odkaz:
http://arxiv.org/abs/2106.08696
We present a shared-memory algorithm to compute high-quality solutions to the balanced $k$-way hypergraph partitioning problem. This problem asks for a partition of the vertex set into $k$ disjoint blocks of bounded size that minimizes the connectivi
Externí odkaz:
http://arxiv.org/abs/2104.08107
The balanced hypergraph partitioning problem (HGP) is to partition the vertex set of a hypergraph into k disjoint blocks of bounded weight, while minimizing an objective function defined on the hyperedges. Whereas real-world applications often use ve
Externí odkaz:
http://arxiv.org/abs/2102.01378
Hypergraph partitioning is an important preprocessing step for optimizing data placement and minimizing communication volumes in high-performance computing applications. To cope with ever growing problem sizes, it has become increasingly important to
Externí odkaz:
http://arxiv.org/abs/2010.10272
The balanced hypergraph partitioning problem is to partition a hypergraph into $k$ disjoint blocks of bounded size such that the sum of the number of blocks connected by each hyperedge is minimized. We present an improvement to the flow-based refinem
Externí odkaz:
http://arxiv.org/abs/2003.12110
A directed acyclic hypergraph is a generalized concept of a directed acyclic graph, where each hyperedge can contain an arbitrary number of tails and heads. Directed hypergraphs can be used to model data flow and execution dependencies in streaming a
Externí odkaz:
http://arxiv.org/abs/2002.02962
We propose a new problem formulation for graph partitioning that is tailored to the needs of time-critical simulations on modern heterogeneous supercomputers.
Comment: Extended abstract accepted at CSC'20
Comment: Extended abstract accepted at CSC'20
Externí odkaz:
http://arxiv.org/abs/2001.09645