A Multiple Ring Fast Computing Method Based on MapReduce in Digraph

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

Full description

Saved in:
Bibliographic Details
Published inApplied Mechanics and Materials Vol. 543-547; no. Vehicle, Mechatronics and Information Technologies II; pp. 3655 - 3658
Main Authors Yang, Jian Jun, Shan, Dan Jun
Format Journal Article
LanguageEnglish
Published Zurich Trans Tech Publications Ltd 01.03.2014
Subjects
Algorithms
Computation
Computer networks
Graph theory
Graphs
Programming
Graph Algorithm
Multiple Rings
Fast Algorithm Method
MapReduce
Online AccessGet full text
ISBN3038350605
9783038350606
ISSN1660-9336
1662-7482
1662-7482
DOI10.4028/www.scientific.net/AMM.543-547.3655

Cover

More Information
Summary: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.
Bibliography:Selected, peer reviewed papers from the 2014 International Conference on Vehicle & Mechanical Engineering and Information Technology (VMEIT 2014), February 19-20, 2014, Beijing, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISBN:3038350605
9783038350606
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.543-547.3655