Enhancing Balanced Graph Edge Partition with Effective Local Search

by   Zhenyu Guo, et al.

Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge partition has demonstrated more promising performance in power-law graphs than vertex partition and thereby has been more widely adopted as the default partition strategy by existing graph systems. The graph edge partition problem, which is to split the edge set into multiple balanced parts to minimize the total number of copied vertices, has been widely studied from the view of optimization and algorithms. In this paper, we study local search algorithms for this problem to further improve the partition results from existing methods. More specifically, we propose two novel concepts, namely adjustable edges and blocks. Based on these, we develop a greedy heuristic as well as an improved search algorithm utilizing the property of the max-flow model. To evaluate the performance of our algorithms, we first provide adequate theoretical analysis in terms of the approximation quality. We significantly improve the previously known approximation ratio for this problem. Then we conduct extensive experiments on a large number of benchmark datasets and state-of-the-art edge partition strategies. The results show that our proposed local search framework can further improve the quality of graph partition by a wide margin.


page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8


A local search 4/3-approximation algorithm for the minimum 3-path partition problem

Given a graph G = (V, E), the 3-path partition problem is to find a mini...

Matroid-Constrained Vertex Cover

In this paper, we introduce the problem of Matroid-Constrained Vertex Co...

Propagators and Violation Functions for Geometric and Workload Constraints Arising in Airspace Sectorisation

Airspace sectorisation provides a partition of a given airspace into sec...

Parallel Unconstrained Local Search for Partitioning Irregular Graphs

We present new refinement heuristics for the balanced graph partitioning...

ILP-based Local Search for Graph Partitioning

Computing high-quality graph partitions is a challenging problem with nu...

Bus Frequency Optimization: When Waiting Time Matters in User Satisfaction

Reorganizing bus frequency to cater for the actual travel demand can sav...

A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs

This paper proposes a local search algorithm for a specific combinatoria...

Please sign up or login with your details

Forgot password? Click here to reset