Multilevel Acyclic Hypergraph Partitioning

02/06/2020
by   Merten Popp, et al.
14

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 applications. Thus, hypergraph partitioning algorithms can be used to obtain efficient parallelizations for multiprocessor architectures. However, an acyclicity constraint on the partition is necessary when mapping streaming applications to embedded multiprocessors due to resource restrictions on this type of hardware. The acyclic hypergraph partitioning problem is to partition the hypernodes of a directed acyclic hypergraph into a given number of blocks of roughly equal size such that the corresponding quotient graph is acyclic while minimizing an objective function on the partition. Here, we contribute the first n-level algorithm for the acyclic hypergraph partitioning problem. Our focus is on acyclic hypergraphs where hyperedges can have one head and arbitrary many tails. Based on this, we engineer a memetic algorithm to further reduce communication cost, as well as to improve scheduling makespan on embedded multiprocessor architectures. Experiments indicate that our algorithm outperforms previous algorithms that focus on the directed acyclic graph case which have previously been employed in the application domain. Moreover, our experiments indicate that using the directed hypergraph model for this type of application yields a significantly smaller makespan.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2017

Evolutionary Acyclic Graph Partitioning

Directed graphs are widely used to model data flow and execution depende...
research
04/14/2021

Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time

We investigate the two problems of computing the union join graph as wel...
research
07/13/2021

The Dynamic Complexity of Acyclic Hypergraph Homomorphisms

Finding a homomorphism from some hypergraph 𝒬 (or some relational struct...
research
07/27/2022

A Simple and Elegant Mathematical Formulation for the Acyclic DAG Partitioning Problem

This work addresses the NP-Hard problem of acyclic directed acyclic grap...
research
05/05/2014

A Continuous Max-Flow Approach to Multi-Labeling Problems under Arbitrary Region Regularization

The incorporation of region regularization into max-flow segmentation ha...
research
04/03/2017

Graph Partitioning with Acyclicity Constraints

Graphs are widely used to model execution dependencies in applications. ...
research
03/09/2021

Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments

Many well-known, real-world problems involve dynamic data which describe...

Please sign up or login with your details

Forgot password? Click here to reset