4.6 Article

Spatial Task Scheduling for Cost Minimization in Distributed Green Cloud Data Centers

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TASE.2018.2857206

关键词

Bat algorithm; cost minimization; distributed computing; green data centers; hybrid metaheuristic optimization; simulated annealing (SA); task scheduling

资金

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

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

The infrastructure resources in distributed green cloud data centers (DGCDCs) are shared by multiple heterogeneous applications to provide flexible services to global users in a high-performance and low-cost way. It is highly challenging to minimize the total cost of a DGCDC provider in a market, where bandwidth prices of Internet service providers (ISPs), electricity prices, and the availability of renewable green energy all vary with geographical locations. Unlike existing studies, this paper proposes a spatial task scheduling and resource optimization (STSRO) method to minimize the total cost of their provider by cost-effectively scheduling all arriving tasks of heterogeneous applications to meet tasks' delay-bound constraints. STSRO well exploits spatial diversity in DGCDCs. In each time slot, the cost minimization problem for DGCDCs is formulated as a constrained optimization one and solved by the proposed simulated annealing-based bat algorithm (SBA). Trace-driven experiments demonstrate that STSRO achieves lower total cost and higher throughput than two typical scheduling methods. Note to Practitioners-This paper investigates the cost minimization problem for DGCDCs while meeting delay-bound constraints for all arriving tasks. Previous task scheduling methods do not jointly investigate the spatial diversity in bandwidth prices of ISPs, electricity prices, and the availability of renewable green energy. Therefore, they fail to cost-effectively schedule all arriving tasks of heterogeneous applications during their delay-bound constraints. In this paper, a new method that overcomes the shortcomings of the existing methods is proposed. It is obtained by using the proposed SBA that solves a constrained optimization problem. Simulation results demonstrate that compared with two typical scheduling methods, it increases the throughput and decreases the cost. It can be readily implemented and integrated into real-world industrial DGCDCs. The future work needs to investigate the indeterminacy of renewable energy and the uncertainty in arriving tasks with rough deep neural network approaches on STSRO.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

暂无数据
暂无数据