Property Graph Partition Algorithm Based on Improved Barnacle Mating Optimization

Abstract Distributed graph processing systems have been used more frequently in various fields, and graph partitioning is the basis of these systems. Graph partitioning algorithms generally aim to minimize the communication cost while the number of vertices or edges reach the load balance. But the vertices and/or edges of property graphs require some storage volume, so the traditional graph partition algorithms will lead to an unbalanced storage volume load. This paper proposes an edge-cut graph partitioning algorithm to generate partitions with equal size and storage volume as well as low cut-edge ratio. Initially, it partitions the graph into k partitions with equal size and storage volume. It then migrates vertices based on the improved Barnacles mating optimizer. The experiments on real-world graphs show that the proposed algorithm can achieve the partition size of volume balance, and the cut-edge ratio is also very low.