TY - JOUR
T1 - Biobjective Task Scheduling for Distributed Green Data Centers
AU - Yuan, Haitao
AU - Bi, Jing
AU - Zhou, Mengchu
AU - Liu, Qing
AU - Ammari, Ahmed Chiheb
N1 - Funding Information:
Manuscript received June 23, 2019; revised September 14, 2019; accepted December 7, 2019. Date of publication January 7, 2020; date of current version April 7, 2021. This article was recommended for publication by Associate Editor A. Matta and Editor Y. Tang upon evaluation of the reviewers’ comments. This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grant 61802015 and Grant 61703011, in part by the Major Science and Technology Program for Water Pollution Control and Treatment of China under Grant 2018ZX07111005, in part by the National Defense Pre-Research Foundation of China under Grant 41401020401 and Grant 41401050102, and in part by Sultan Qaboos University through the Omantel Research Program under Grant EG/SQU-OT/19/04. (Corresponding author: Jing Bi.) H. Yuan, M. Zhou, and Q. Liu are with the Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102 USA (e-mail: haitao.yuan@njit.edu; zhou@njit.edu; qing.liu@njit.edu).
Publisher Copyright:
© 2004-2012 IEEE.
PY - 2021/4
Y1 - 2021/4
N2 - The industry of data centers is the fifth largest energy consumer in the world. Distributed green data centers (DGDCs) consume 300 billion kWh per year to provide different types of heterogeneous services to global users. Users around the world bring revenue to DGDC providers according to actual quality of service (QoS) of their tasks. Their tasks are delivered to DGDCs through multiple Internet service providers (ISPs) with different bandwidth capacities and unit bandwidth price. In addition, prices of power grid, wind, and solar energy in different GDCs vary with their geographical locations. Therefore, it is highly challenging to schedule tasks among DGDCs in a high-profit and high-QoS way. This work designs a multiobjective optimization method for DGDCs to maximize the profit of DGDC providers and minimize the average task loss possibility of all applications by jointly determining the split of tasks among multiple ISPs and task service rates of each GDC. A problem is formulated and solved with a simulated-Annealing-based biobjective differential evolution (SBDE) algorithm to obtain an approximate Pareto-optimal set. The method of minimum Manhattan distance is adopted to select a knee solution that specifies the Pareto-optimal task service rates and task split among ISPs for DGDCs in each time slot. Real-life data-based experiments demonstrate that the proposed method achieves lower task loss of all applications and larger profit than several existing scheduling algorithms. Note to Practitioners-This work aims to maximize the profit and minimize the task loss for DGDCs powered by renewable energy and smart grid by jointly determining the split of tasks among multiple ISPs. Existing task scheduling algorithms fail to jointly consider and optimize the profit of DGDC providers and QoS of tasks. Therefore, they fail to intelligently schedule tasks of heterogeneous applications and allocate infrastructure resources within their response time bounds. In this work, a new method that tackles drawbacks of existing algorithms is proposed. It is achieved by adopting the proposed SBDE algorithm that solves a multiobjective optimization problem. Simulation experiments demonstrate that compared with three typical task scheduling approaches, it increases profit and decreases task loss. It can be readily and easily integrated and implemented in real-life industrial DGDCs. The future work needs to investigate the real-Time green energy prediction with historical data and further combine prediction and task scheduling together to achieve greener and even net-zero-energy data centers.
AB - The industry of data centers is the fifth largest energy consumer in the world. Distributed green data centers (DGDCs) consume 300 billion kWh per year to provide different types of heterogeneous services to global users. Users around the world bring revenue to DGDC providers according to actual quality of service (QoS) of their tasks. Their tasks are delivered to DGDCs through multiple Internet service providers (ISPs) with different bandwidth capacities and unit bandwidth price. In addition, prices of power grid, wind, and solar energy in different GDCs vary with their geographical locations. Therefore, it is highly challenging to schedule tasks among DGDCs in a high-profit and high-QoS way. This work designs a multiobjective optimization method for DGDCs to maximize the profit of DGDC providers and minimize the average task loss possibility of all applications by jointly determining the split of tasks among multiple ISPs and task service rates of each GDC. A problem is formulated and solved with a simulated-Annealing-based biobjective differential evolution (SBDE) algorithm to obtain an approximate Pareto-optimal set. The method of minimum Manhattan distance is adopted to select a knee solution that specifies the Pareto-optimal task service rates and task split among ISPs for DGDCs in each time slot. Real-life data-based experiments demonstrate that the proposed method achieves lower task loss of all applications and larger profit than several existing scheduling algorithms. Note to Practitioners-This work aims to maximize the profit and minimize the task loss for DGDCs powered by renewable energy and smart grid by jointly determining the split of tasks among multiple ISPs. Existing task scheduling algorithms fail to jointly consider and optimize the profit of DGDC providers and QoS of tasks. Therefore, they fail to intelligently schedule tasks of heterogeneous applications and allocate infrastructure resources within their response time bounds. In this work, a new method that tackles drawbacks of existing algorithms is proposed. It is achieved by adopting the proposed SBDE algorithm that solves a multiobjective optimization problem. Simulation experiments demonstrate that compared with three typical task scheduling approaches, it increases profit and decreases task loss. It can be readily and easily integrated and implemented in real-life industrial DGDCs. The future work needs to investigate the real-Time green energy prediction with historical data and further combine prediction and task scheduling together to achieve greener and even net-zero-energy data centers.
KW - Cloud data centers
KW - green computing
KW - multiobjective differential evolution (DE)
KW - quality of service (QoS)
KW - simulated annealing (SA)
KW - task scheduling
UR - http://www.scopus.com/inward/record.url?scp=85104068307&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85104068307&partnerID=8YFLogxK
U2 - 10.1109/TASE.2019.2958979
DO - 10.1109/TASE.2019.2958979
M3 - Article
AN - SCOPUS:85104068307
SN - 1545-5955
VL - 18
SP - 731
EP - 742
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
IS - 2
M1 - 8951255
ER -