4.7 Article

Temporal Task Scheduling of Multiple Delay-Constrained Applications in Green Hybrid Cloud

期刊

IEEE TRANSACTIONS ON SERVICES COMPUTING
卷 14, 期 5, 页码 1558-1570

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TSC.2018.2878561

关键词

Task analysis; Cloud computing; Delays; Data centers; Green products; Optimization; Analytical models; Green data center; hybrid cloud; task scheduling; delay-constrained applications; hybrid meta-heuristic optimization

资金

  1. National Natural Science Foundation of China [61802015, 61703011]
  2. China Postdoctoral Science Foundation [2017T100034, 2016M600912]
  3. Fundamental Research Funds for the Central Universities [2016RC030]

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

Global companies are increasingly choosing Green Data Centers to manage delay-constrained applications, and the use of hybrid cloud technology to address the scheduling challenge, but temporal variations in factors make efficiency difficult. The study proposes a scheduling algorithm based on temporal variation and solves the maximization problem through an optimization algorithm to achieve greater profits.
A growing number of global companies select Green Data Centers (GDCs) to manage their delay-constrained applications. The fast growth of users' tasks dramatically increases the energy consumed by GDCs owned by a company, e.g., Google and Amazon. The random nature of tasks brings a big challenge of scheduling tasks of each application with limited infrastructure resources of GDCs. Therefore, hybrid cloud is widely employed to smartly outsource some tasks to public clouds. However, the temporal variation in many factors including revenue, price of power grid, solar irradiance, wind speed, price of public clouds makes it challenging to schedule all tasks of each application in a cost-effective way while strictly meeting their expected delay constraints. This work proposes a temporal task scheduling algorithm investigating the temporal variation in green hybrid cloud to schedule all tasks within their delay constraints. Besides, it explicitly presents a mathematical equation of service rates and task refusal. The maximization problem is formulated and tackled by the proposed hybrid optimization algorithm called Genetic Simulated-annealing-based particle swarm optimization. Trace-driven experiments demonstrate that larger profit are achieved than several existing scheduling algorithms.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据