Trade-off Between Energy Consumption and Makespan in the Mapreduce Resource Allocation Problem

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

Abstract

Minimizing energy consumption when executing Mapreduce jobs is a significant challenge for data centers; however, it traditionally conflicts with the system performance. This paper aims to address this problem by making a trade-off between energy consumption and performance. In this paper, we design an integer linear bi-objective optimization model and propose a two-phase heuristic allocation algorithm to find a high-quality feasible solution. By adopting Non-dominated Sorting Genetic Algorithm II with the feasible solution, we obtain a set of Pareto optimal solutions to minimize both energy consumption and makespan. Finally, we perform experiments on several real workloads to evaluate the solutions produced by our proposed algorithm and analyze the trade-off relationship between energy and makespan. The results show that the Pareto optimal solutions are close to the lower bound obtained by the relaxation of the integer linear bi-objective optimization model and can also assist system manager to make intelligent resource allocation decisions for Mapreduce applications based on the energy efficiency and performance needs of the system.

Cite

CITATION STYLE

APA

Zhang, X., Liu, X., Li, W., & Zhang, X. (2019). Trade-off Between Energy Consumption and Makespan in the Mapreduce Resource Allocation Problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11633 LNCS, pp. 239–250). Springer Verlag. https://doi.org/10.1007/978-3-030-24265-7_21

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