Towards energy-efficient scheduling for real-time tasks under uncertain cloud computing environment

被引:127
作者
Chen, Huangke [1 ]
Zhu, Xiaomin [1 ]
Guo, Hui [2 ]
Zhu, Jianghan [1 ]
Qin, Xiao [3 ]
Wu, Jianhong [4 ]
机构
[1] Natl Univ Def Technol, Sci & Technol Informat Syst Engn Lab, Changsha 410073, Hunan, Peoples R China
[2] Univ New S Wales, Sch Engn & Comp Sci, Sydney, NSW 2052, Australia
[3] Auburn Univ, Dept Comp Sci & Software Engn, Auburn, AL 36849 USA
[4] York Univ, Dept Math & Stat, Toronto, ON M3J 1P3, Canada
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Green cloud computing; Uncertain scheduling; Proactive and reactive; DATA CENTERS; DYNAMIC CONSOLIDATION; VIRTUAL MACHINES; PERFORMANCE; SYSTEMS; POWER;
D O I
10.1016/j.jss.2014.08.065
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Green cloud computing has become a major concern in both industry and academia, and efficient scheduling approaches show promising ways to reduce the energy consumption of cloud computing platforms while guaranteeing QoS requirements of tasks. Existing scheduling approaches are inadequate for real-time tasks running in uncertain cloud environments, because those approaches assume that cloud computing environments are deterministic and pre-computed schedule decisions will be statically followed during schedule execution. In this paper, we address this issue. We introduce an interval number theory to describe the uncertainty of the computing environment and a scheduling architecture to mitigate the impact of uncertainty on the task scheduling quality for a cloud data center. Based on this architecture, we present a novel scheduling algorithm (PRS1) that dynamically exploits proactive and reactive scheduling methods, for scheduling real-time, aperiodic, independent tasks. To improve energy efficiency, we propose three strategies to scale up and down the system's computing resources according to workload to improve resource utilization and to reduce energy consumption for the cloud data center. We conduct extensive experiments to compare PRS with four typical baseline scheduling algorithms. The experimental results show that PRS performs better than those algorithms, and can effectively improve the performance of a cloud data center. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:20 / 35
页数:16
相关论文
共 38 条
[1]   Joint Optimization of Idle and Cooling Power in Data Centers While Maintaining Response Time [J].
Ahmad, Faraz ;
Vijaykumar, T. N. .
ACM SIGPLAN NOTICES, 2010, 45 (03) :243-256
[2]  
ANDERSON D., 2013, STAT BUSINESS EC
[3]  
[Anonymous], 2010, 2010 IEEE 3 INT C CL
[4]  
[Anonymous], NY TIMES
[5]  
[Anonymous], 2008, POWER AWARE COMPUTIN
[6]  
[Anonymous], IEEE S SERV OR SYST
[7]   A View of Cloud Computing [J].
Armbrust, Michael ;
Fox, Armando ;
Griffith, Rean ;
Joseph, Anthony D. ;
Katz, Randy ;
Konwinski, Andy ;
Lee, Gunho ;
Patterson, David ;
Rabkin, Ariel ;
Stoica, Ion ;
Zaharia, Matei .
COMMUNICATIONS OF THE ACM, 2010, 53 (04) :50-58
[8]  
Barham P., 2003, Xen and the art of virtualization, V37, P164, DOI [DOI 10.1145/1165389.945462, 10.1145/1165389.945462]
[9]   Managing Overloaded Hosts for Dynamic Consolidation of Virtual Machines in Cloud Data Centers under Quality of Service Constraints [J].
Beloglazov, Anton ;
Buyya, Rajkumar .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (07) :1366-1379
[10]   Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in Cloud data centers [J].
Beloglazov, Anton ;
Buyya, Rajkumar .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2012, 24 (13) :1397-1420