Please use this identifier to cite or link to this item:
Title: Evaluating large graph processing in MapReduce based on message passing
Authors: Pan, W.
Li, Z.-H.
Wu, S. 
Chen, Q.
Keywords: BSP model
Cloud computing
Graph algorithms
Message passing
Issue Date: 2011
Citation: Pan, W.,Li, Z.-H.,Wu, S.,Chen, Q. (2011). Evaluating large graph processing in MapReduce based on message passing. Jisuanji Xuebao/Chinese Journal of Computers 34 (10) : 1768-1784. ScholarBank@NUS Repository.
Abstract: Since analyzing large-scale graph is usually difficult to be implemented on a single machine, how to design efficient parallel large-scale graph algorithms is receiving more and more attention. Constrained by embarrassingly parallel assumption, parallel graph algorithms are not easy to express in MapReduce. Inspired by Bulk Synchronous Parallel model, we propose a message-enhanced version of Hadoop MapReduce that breaks its key assumption. Enhanced implementation is compatible with original Hadoop MapReduce, existing Hadoop MapReduce programs can run directly on this platform without modification, and uses message passing mechanisms to facilitate interactive data communication between supersteps of tasks. It also provides a highly flexible self-defined message passing interface and two adaptive message passing mechanisms to support efficient implementation of graph algorithms with data transition and iterative computation. The experimental results on the real Stanford large network dataset collection demonstrate the superiority of enhanced version over original Hadoop MapReduce on PageRank algorithm.
Source Title: Jisuanji Xuebao/Chinese Journal of Computers
ISSN: 02544164
DOI: 10.3724/SP.J.1016.2011.01768
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Sep 30, 2022

Page view(s)

checked on Sep 22, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.