A Multiple Ring Fast Computing Method Based on MapReduce in Digraph

Article Preview

Abstract:

Graph algorithm has been widely used in modern computer network technology, and with the increase of data, graph algorithm is faced with the challenge of big data. Using MapReduce programming framework, this paper puts forward a multiple ring fast computing method in diagraph. Compared with the previous methods, this method is more efficient. And through the experiment the method are compared with the previous method.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3655-3658

Citation:

Online since:

March 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J. Lin,C. Dyer,Data-Intensive Text Processing with MapReduce. Morgan & Claypool Publishers,(2010).

Google Scholar

[2] Matei Zaharia, Andy Knowinski, Improving MapReduce Performance in Heterogeneous Environments, Proceedings of the 8th USENIX conference on Operating Systems Design and Implementation (Pages: 29-42, Year of Publication: 2008).

Google Scholar

[3] Jimmy Lin, Michael Schatz, Design Patterns for Efficient Graph Algorithms in MapReduce, Proceedings of the Eighth Workshop on Mining and Learning with Graphs (Pages: 78-85 Year of Publication: 2010 ISBN: 978-1-4503-0214-2).

DOI: 10.1145/1830252.1830263

Google Scholar

[4] Ian X.Y. Leung,Pan Hui,Pietro Li'o, et al, Towards real-time community detection in large networks. Physical Review. 79(6),(2009).

Google Scholar