HPMR: Prefetching and pre-shuffling in shared MapReduce computation environment

114Citations
Citations of this article
65Readers
Mendeley users who have this article in their library.
Get full text

Abstract

MapReduce is a programming model that supports distributed and parallel processing for large-scale data-intensive applications such as machine learning, data mining, and scientific simulation. Hadoop is an open-source implementation of the MapReduce programming model. Hadoop is used by many companies including Yahoo!, Amazon, and Facebook to perform various data mining on large-scale data sets such as user search logs and visit logs. In these cases, it is very common to share the same computing resources by multiple users due to practical considerations about cost, system utilization, and manageability. However, Hadoop assumes that all cluster nodes are dedicated to a single user, failing to guarantee high performance in the shared MapReduce computation environment. In this paper, we propose two optimization schemes, prefetching and pre-shuffling, which improve the overall performance under the shared environment while retaining compatibility with the native Hadoop. The proposed schemes are implemented in the native Hadoop-0.18.3 as a plug-in component called HPMR (High Performance MapReduce Engine). Our evaluation on the Yahoo!Grid platform with three different workloads and seven types of test sets from Yahoo! shows that HPMR reduces the execution time by up to 73%.©2009 IEEE.

Cite

CITATION STYLE

APA

Seo, S., Jang, I., Woo, K., Kim, I., Kim, J. S., & Maeng, S. (2009). HPMR: Prefetching and pre-shuffling in shared MapReduce computation environment. In Proceedings - IEEE International Conference on Cluster Computing, ICCC. https://doi.org/10.1109/CLUSTR.2009.5289171

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free