International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

A Survey on Hierarchical Merge for Hadoop-A

Vaibhav Dhore, Sonali R. Jagtap

Abstract: Hadoop is a popular open source implementation of the Map Reduce programming model for cloud computing. However, it faces a number of issues to achieve the best performance from the underlying systems. These include a serialization barrier that delays the reduce phase, repetitive merges, and disk accesses, and the lack of portability to different interconnects. We describe Hadoop-A, an acceleration framework that optimizes Hadoop with plug-in components for fast data movement, overcoming the existing limitations. A Hierarchical merge algorithm is introduced to merge data without repetition and disk access. In addition, we are using virtual shuffling to reduce disk access.

Keywords: Hadoop, MapReduce, virtual shuffling, hierarchical merge, Hadoop acceleration

How to Cite?: Vaibhav Dhore, Sonali R. Jagtap, "A Survey on Hierarchical Merge for Hadoop-A", Volume 4 Issue 1, January 2015, International Journal of Science and Research (IJSR), Pages: 591-593, https://www.ijsr.net/getabstract.php?paperid=SUB15240, DOI: https://dx.doi.org/10.21275/SUB15240

Download Citation: APA | MLA | BibTeX | EndNote | RefMan

Share This Research

Help this article reach readers, researchers and professionals.

Share activity is measured for research-engagement analytics. Only verified, unique public shares can support award tie-breaking.

Confirm Your Share

Enter your details so IJSR can confirm this sharing activity.

Your details are used to validate this share and protect the award process from duplicate or false activity.

Download Article PDF


Rate This Article!

Top

Confirm Your Share

Enter your details so IJSR can confirm this sharing activity.

Your details are used to validate this share and protect the award process from duplicate or false activity.