TY - JOUR
T1 - Fine-grained resource provisioning and task scheduling for heterogeneous applications in distributed green clouds
AU - Yuan, Haitao
AU - Zhou, Mengchu
AU - Liu, Qing
AU - Abusorrah, Abdullah
N1 - Funding Information:
Manuscript received January 28, 2020; revised February 22, 2020; accepted March 17, 2020. This work was supported in part by the National Natural Science Foundation of China (61802015, 61703011), the Major Science and Technology Program for Water Pollution Control and Treatment of China (2018ZX07111005), the National Defense Pre-Research Foundation of China (41401020401, 41401050102) and the Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah (D-422-135-1441). Recommended by Associate Editor Peiyun Zhang. (Corresponding author: Haitao Yuan and MengChu Zhou.) Citation: H. T. Yuan, M. C. Zhou, Q. Liu, and A. Abusorrah, “Fine-grained resource provisioning and task scheduling for heterogeneous applications in distributed green clouds,” IEEE/CAA J. Autom. Sinica, vol. 7, no. 5, pp. 1380–1393, Sept. 2020.
Publisher Copyright:
© 2014 Chinese Association of Automation.
PY - 2020/9
Y1 - 2020/9
N2 - An increasing number of enterprises have adopted cloud computing to manage their important business applications in distributed green cloud DGC systems for low response time and high cost-effectiveness in recent years. Task scheduling and resource allocation in DGCs have gained more attention in both academia and industry as they are costly to manage because of high energy consumption. Many factors in DGCs, e.g., prices of power grid, and the amount of green energy express strong spatial variations. The dramatic increase of arriving tasks brings a big challenge to minimize the energy cost of a DGC provider in a market where above factors all possess spatial variations. This work adopts a G G 1 queuing system to analyze the performance of servers in DGCs. Based on it, a single-objective constrained optimization problem is formulated and solved by a proposed simulated-annealing-based bees algorithm SBA to find SBA can minimize the energy cost of a DGC provider by optimally allocating tasks of heterogeneous applications among multiple DGCs, and specifying the running speed of each server and the number of powered-on servers in each GC while strictly meeting response time limits of tasks of all applications. Realistic data-based experimental results prove that SBA achieves lower energy cost than several benchmark scheduling methods do.
AB - An increasing number of enterprises have adopted cloud computing to manage their important business applications in distributed green cloud DGC systems for low response time and high cost-effectiveness in recent years. Task scheduling and resource allocation in DGCs have gained more attention in both academia and industry as they are costly to manage because of high energy consumption. Many factors in DGCs, e.g., prices of power grid, and the amount of green energy express strong spatial variations. The dramatic increase of arriving tasks brings a big challenge to minimize the energy cost of a DGC provider in a market where above factors all possess spatial variations. This work adopts a G G 1 queuing system to analyze the performance of servers in DGCs. Based on it, a single-objective constrained optimization problem is formulated and solved by a proposed simulated-annealing-based bees algorithm SBA to find SBA can minimize the energy cost of a DGC provider by optimally allocating tasks of heterogeneous applications among multiple DGCs, and specifying the running speed of each server and the number of powered-on servers in each GC while strictly meeting response time limits of tasks of all applications. Realistic data-based experimental results prove that SBA achieves lower energy cost than several benchmark scheduling methods do.
UR - http://www.scopus.com/inward/record.url?scp=85086276428&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85086276428&partnerID=8YFLogxK
U2 - 10.1109/JAS.2020.1003177
DO - 10.1109/JAS.2020.1003177
M3 - Article
AN - SCOPUS:85086276428
SN - 2329-9266
VL - 7
SP - 1380
EP - 1393
JO - IEEE/CAA Journal of Automatica Sinica
JF - IEEE/CAA Journal of Automatica Sinica
IS - 5
M1 - 9106869
ER -