Energy Efficiency MapReduce Job Scheduling of Shuffle and Reduce Phases in Data Center

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

Abstract

In this paper, job scheduling of shuffle and reduce phases is considered for data center with heterogenous servers to minimize energy consumption. Constructing task list and assigning tasks to slots are designed in a job scheduling framework. The construction of task list considers jobs’ deadlines and tasks’ processing times. Two main steps (candidate servers construction and allocate tasks) are in the proposed assignment. The set of candidate servers is constructed in terms of data size and network topology. Allocation of tasks and slots with normalized shuffle time and data size decreases completion times of jobs, in which shuffle time is calculated by two new bandwidth allocations considering deadlines. Experimental results show that the proposed job scheduling consumes less energy than other existing adapted task scheduling strategies.

Cite

CITATION STYLE

APA

Wang, J., Li, X., & Zhu, X. (2019). Energy Efficiency MapReduce Job Scheduling of Shuffle and Reduce Phases in Data Center. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11354 LNCS, pp. 209–221). Springer Verlag. https://doi.org/10.1007/978-3-030-15127-0_22

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