By Topic

Comparison of the Efficiency of MapReduce and Bulk Synchronous Parallel Approaches to Large Network Processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tomasz Kajdanowicz ; Inst. of Inf., Wroclaw Univ. of Technol., Wroclaw, Poland ; Wojciech Indyk ; Przemyslaw Kazienko ; Jakub Kukul

Network structures, especially social networks, grow rapidly and provide huge datasets intractable to analyse. In this paper, two parallel approaches to process large graph structures within the Hadoop environment were compared: Bulk Synchronous Parallel (BSP) and MapReduce (MR). The experimental studies were carried out for two different graph problems: collective classification by means of Relational Influence Propagation (RIP) and Single Source Shortest Path (SSSP) calculation. The appropriate BSP and MapReduce algorithms for these problems were applied to various network datasets differing in size and structural profile, originating from three domains: telecommunication, multimedia and microblog. The collected results revealed that iterative graph processing with BSP implementation significantly outperform popular MapReduce, especially for algorithms with many iterations and sparse communication. However, MapReduce still remains the only alternative for enormous networks.

Published in:

2012 IEEE 12th International Conference on Data Mining Workshops

Date of Conference:

10-10 Dec. 2012