Summary of Large-Scale Grapb Partitioning Algoritbms

The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were discussed. Then the advantages and disadvantages of...

Full description

Saved in:
Bibliographic Details
Published inDianxin Kexue Vol. 30; pp. 100 - 106
Main Authors Jinfeng Xu, Yihong Dong, Shiyi Wang, Xianmang He, Huahui Chen
Format Journal Article
LanguageChinese
Published Beijing Xintong Media Co., Ltd 01.07.2014
Subjects
big data;large-scale graph;distributed graph partitioning;load balancing;bulk synchronous parallel model;MapReduce;dynamic graphs
Online AccessGet full text
ISSN1000-0801

Cover

More Information
Summary:The large-scale graph partitioning algorithms were summarized and graph computing models in the distributed environment were introduced. Firstly the large-scale static graph partitioning algorithms and the dynamic graph partitioning algorithms were discussed. Then the advantages and disadvantages of these algorithms and its adaptability conscientiously were sumed up. Finally, some meaningful research subjects about the distributed graph partition, which have not been explored were pointed out.
ISSN:1000-0801