Context‐aware scheduling in MapReduce: a compact review

Citations Over TimeTop 10% of 2015 papers

Abstract

Summary It is a fact that the attention of research community in computer science, business executives, and decision makers is drastically drawn by big data. As the volume of data becomes bigger, it needs performance‐oriented data‐intensive processing frameworks such as MapReduce, which can scale computation on large commodity clusters. Hadoop MapReduce processes data in Hadoop Distributed File System as jobs scheduled according to YARN fair scheduler and capacity scheduler. However, with advancement and dynamic changes in hardware and operating environments, the performance of clusters is greatly affected. Various efforts in literature have been made to address the issues of heterogeneity (i.e., clusters consisting of virtual machines and machines with different hardware), network communication, data locality, better resource utilization, and run‐time scheduling. In this paper, we present a survey to discuss various research efforts made so far to improve Hadoop MapReduce scheduling. We classify scheduling algorithms and techniques proposed in the literature so far based on their addressing areas and present a taxonomy. Furthermore, we also discuss various aspects of open issues and challenges in the scheduling of MapReduce to improve its performance. Copyright © 2015 John Wiley & Sons, Ltd.

Related Papers

• → Clarification of the Stretching Process of Newly-Developed Open-End Rotor-Spun Hollow Yarn(2012)2 cited
• DISCUSSION ON TWIST OF SIRO-SPUN YARN(2003)
• → Regressional Optimizations of Cotton Spun Yarn by Controlling its Process Parameters(2021)2 cited
• Design of yarn detection passage of yarn clearer of capacitance type(2008)
• The Influence of Spun Yarn Fittings on Yarn Quality(2002)