LGP-SA：Graph partition algorithm based on simulated annealing in large-scale graph processing

Distributed computing for large-scale graph data need to partition the graph firstly. The current methods of large-scale graph partitioning is to reduce the edge cut in order to lessen communication overhead by using vertex transfer strategies，but easily to fall into local optimum. Simulated anneali...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Jinfeng XU, Yihong DONG, Shiyi WANG, Xianmang HE, Huahui CHEN
Médium:	Artigo
Jazyk:	Chinês
Vydáno:	Beijing Xintong Media Co., Ltd 2016-02-01
Edice:	Dianxin kexue
Témata:	graph partition;Giraph;simulated annealing;large-scale graph;BSP
On-line přístup:	http://www.telecomsci.com/thesisDetails#10.3969/j.issn.1000-0801.2016.02.012
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!