Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments

Abstract

Many well-known, real-world problems involve dynamic, interrelated data items. Hypergraphs are powerful combinatorial structures that are frequently used to model such data. Many of today's data-centric have streaming data; new items arrive continuously, and the data grow over time. With paradigms such as Internet of Things and Edge Computing, such applications become more natural and more practical. In this work, we assume a streaming model where the data items and their relations are modeled as a hypergraph, which is generated at the edge. This hypergraph is then partitioned, and the parts are sent to remote nodes via an algorithm running on a memory-restricted device, such as a single board computer. Such a partitioning is usually performed by taking a connectivity metric into account to minimize the communication cost of later analyses that will be performed in a distributed fashion. Although there are many offline tools that can partition static hypergraphs effectively, algorithms for the streaming settings are rare. We analyze a well-known algorithm from the literature and significantly improve its run time by altering its inner data structure. On a medium-scale hypergraph, the new algorithm reduces the run time from 17800 seconds to 10 seconds. We then propose sketch-and hash-based algorithms, as well as ones that can leverage extra memory to store a small portion of the data to enable the refinement of partitioning when possible. We experimentally analyze the performance of these algorithms and report their run times, connectivity metric scores, and memory uses on a high-end server and four different single-board computer architectures.
Fichier principal
Vignette du fichier
hpcs-streaming.pdf (387.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03182122 , version 1 (26-03-2021)

Identifiers

Cite

Fatih Taşyaran, Berkay Demireller, Kamer Kaya, Bora Uçar. Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments. HPCS 2020 - International Conference on High Performance Computing & Simulation, Mar 2021, Virtual online, Spain. pp.1-8. ⟨hal-03182122⟩
87 View
106 Download

Altmetric

Share

Gmail Facebook X LinkedIn More