Bachelorarbeit BCLR-2018-11

Epple, Lukas: Partitioning billionscale hypergraphs.
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Bachelorarbeit Nr. 11 (2018).
47 Seiten, englisch.

In this thesis, we present a hypergraph partitioning algorithm that achieves both, fast partitioning with high locality. The idea is simple but effective: the algorithm grows k disjoint subgraphs based on the neighbourhood relation and the degree distribution in the hypergraph. We performed extensive experiments and showed that our algorithm leads to perfectly balanced partitions with improved locality compared to state-of-the-art, while matching the fast runtime of streaming hypergraph partitioners.

Volltext und
andere Links
Abteilung(en)Universität Stuttgart, Institut für Parallele und Verteilte Systeme, Verteilte Systeme
BetreuerRothermel, Prof. Kurt; Mayer, Christian
Eingabedatum3. Dezember 2018
   Publ. Informatik