Combinatorics

Graph

Mathematics

Distributed computing

Load balancing (electrical power)

Parallel computing

Grid

Geometry

Computer science

Theoretical computer science

Vertex (graph theory)

Partition (number theory)

Graph partition

IEEE Access

As dynamic graph data have been actively used, incremental graph partition schemes have been studied to efficiently store and manage large graphs. In this paper, we propose a vertex-cut based novel incremental graph partitioning scheme that supports load balancing in a distributed environment. The proposed scheme chooses the load of each node that considers its storage utilization and throughput as the partitioning criterion. The proposed scheme defines hot data that means a particular vertex frequently searched among graphs requested by queries. We manage and utilize hot data for graph partitioning. Finally, we perform vertex-cut based dynamic graph partitioning by using a vertex replication index, the load each node, and hot data to distribute the load evenly in a distributed environment. In order to verify the superiority of the proposed partitioning scheme, we compare it with the existing partitioning schemes through a variety of performance evaluations.

Dynamic Graph Partitioning Scheme for Supporting Load Balancing in Distributed Graph Environments