Skip to Main content Skip to Navigation
Journal articles

Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs

Abstract : We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also known as the edge cut. The standard load balancing constraint of having an equitable partition of the vertices among the parts should be met. Furthermore, the partition is required to be acyclic; i.e., the interpart edges between the vertices from different parts should preserve an acyclic dependency structure among the parts. In this work, we adopt the multilevel approach with coarsening, initial partitioning, and refinement phases for acyclic partitioning of directed acyclic graphs. We focus on two-way partitioning (sometimes called bisection), as this scheme can be used in a recursive way for multiway partitioning. To ensure the acyclicity of the partition at all times, we propose novel and efficient coarsening and refinement heuristics. The quality of the computed acyclic partitions is assessed by computing the edge cut. We also propose effective ways to use the standard undirected graph partitioning methods in our multilevel scheme. We perform a large set of experiments on a dataset consisting of (i) graphs coming from an application and (ii) some others corresponding to matrices from a public collection. We report significant improvements compared to the current state of the art.
Complete list of metadatas

Cited literature [36 references]  Display  Hide  Download
Contributor : Bora Uçar <>
Submitted on : Friday, October 11, 2019 - 7:10:41 PM
Last modification on : Tuesday, November 19, 2019 - 2:40:58 AM


Files produced by the author(s)




Julien Herrmann, Yusuf Özkaya, Bora Uçar, Kamer Kaya, Umit Catalyurek. Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2019, 41 (4), pp.A2117-A2145. ⟨10.1137/18M1176865⟩. ⟨hal-02306566⟩



Record views


Files downloads