4.5 Article

Energy and SLA-driven MapReduce Job Scheduling Framework for Cloud-based Cyber-Physical Systems

期刊

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.1145/3409772

关键词

Cyber-physical systems; energy optimization; job scheduling; greedy approach; Hungarian algorithm, and MapReduce

资金

  1. Tata Consultancy Services (TCS), India
  2. Natural Sciences and Engineering Research Council of Canada (NSERC)
  3. Fonds de recherche du Quebec-Nature et technologies (FRQNT) through PBEEE [287201]
  4. Tier 2 Canada Research Chair on the Next Generations of Wireless IoT Networks

向作者/读者索取更多资源

This article proposes an energy-aware and SLA-driven job scheduling framework based on MapReduce, aimed at exploring the task-to-slot/container mapping problem. By dividing it into three major subproblems and using heuristics along with classical algorithms, energy efficiency is enhanced and energy consumption is reduced.
Energy consumption minimization of cloud data centers (DCs) has attracted much attention from the research community in the recent years; particularly due to the increasing dependence of emerging Cyber-Physical Systems on them. An effective way to improve the energy efficiency of DCs is by using efficient job scheduling strategies. However, the most challenging issue in selection of efficient job scheduling strategy is to ensure service-level agreement (SLA) bindings of the scheduled tasks. Hence, an energy-aware and SLA-driven job scheduling framework based on MapReduce is presented in this article. The primary aim of the proposed framework is to explore task-to-slot/container mapping problem as a special case of energy-aware scheduling in deadline-constrained scenario. Thus, this problem can be viewed as a complex multi-objective problem comprised of different constraints. To address this problem efficiently, it is segregated into three major subproblems (SPs), namely, deadline segregation, map and reduce phase energy-aware scheduling. These SPs are individually formulated using Integer Linear Programming. To solve these SPs effectively, heuristics based on Greedy strategy along with classical Hungarian algorithm for serial and serial-parallel systems are used. Moreover, the proposed scheme also explores the potential of splitting Map/Reduce phase(s) into multiple stages to achieve higher energy reductions. This is achieved by leveraging the concepts of classical Greedy approach and priority queues. The proposed scheme has been validated using real-time data traces acquired from OpenCloud. Moreover, the performance of the proposed scheme is compared with the existing schemes using different evaluation metrics, namely, number of stages, total energy consumption, total makespan, and SLA violated. The results obtained prove the efficacy of the proposed scheme in comparison to the other schemes under different workload scenarios.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据