MRPack: Multi-algorithm execution using compute-intensive approach in MapReduce

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

  • Muhammad Idris
  • Shujaat Hussain
  • Muhammad Hameed Siddiqi
  • Hassan, Waseem
  • Hafiz Syed Muhammad Bilal
  • Sungyoung Lee

Large quantities of data have been generated from multiple sources at exponential rates in the last few years. These data are generated at high velocity as real time and streaming data in variety of formats. These characteristics give rise to challenges in its modeling, computation, and processing. Hadoop MapReduce (MR) is a well known data-intensive distributed processing framework using the distributed file system (DFS) for Big Data. Current implementations of MR only support execution of a single algorithm in the entire Hadoop cluster. In this paper, we propose MapReducePack (MRPack), a variation of MR that supports execution of a set of related algorithms in a single MR job. We exploit the computational capability of a cluster by increasing the compute-intensiveness of MapReduce while maintaining its data-intensive approach. It uses the available computing resources by dynamically managing the task assignment and intermediate data. Intermediate data from multiple algorithms are managed using multi-key and skew mitigation strategies. The performance study of the proposed system shows that it is time, I/O, and memory efficient compared to the default MapReduce. The proposed approach reduces the execution time by 200% with an approximate 50% decrease in I/O cost. Complexity and qualitative results analysis shows significant performance improvement.

OriginalsprogEngelsk
Artikelnummere0136259
TidsskriftPLoS ONE
Vol/bind10
Udgave nummer8
ISSN1932-6203
DOI
StatusUdgivet - 25 aug. 2015
Eksternt udgivetJa

Bibliografisk note

Publisher Copyright:
© 2015 Idris et al.This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

ID: 388954442