With the prevalence of graph data in real-world applications(e.g.,social networks,mobile phone networks,web graphs,etc.)and their everincreasing size,many distributed graph computing systems have been developed in recent years to process and analyze massive graphs.Most of these systems adopt Pregels vertex-centric computing model,while various techniques have been proposed to address the limitations in the Pregel framework.However,there is a lack of comprehensive comparative analysis to evaluate the performance of various systems and their techniques,making it difficult for users to choose the best system for their applications.