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...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	Jinfeng Xu, Yihong Dong, Shiyi Wang, Xianmang He, Huahui Chen
פורמט:	Artigo
שפה:	Chinês
יצא לאור:	Beijing Xintong Media Co., Ltd 2014-07-01
סדרה:	Dianxin kexue
נושאים:	big data;large-scale graph;distributed graph partitioning;load balancing;bulk synchronous parallel model;MapReduce;dynamic graphs
גישה מקוונת:	http://www.telecomsci.com/thesisDetails#10.3969/j.issn.1000-0801.2014.07.016
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!