Power Consumption Optimization for Deadline-Constrained Workflows in Cloud Data Center

被引:4
作者
Zhang, Chi [1 ]
Wang, Yuxin [2 ]
Feng, Zhen [3 ,4 ]
Guo, He [1 ]
机构
[1] Dalian Univ Technol, Sch Software Technol, Dalian, Peoples R China
[2] Dalian Univ Technol, Sch Comp Sci & Technol, Dalian, Peoples R China
[3] State Key Lab High End Server & Storage Technol, Beijing, Peoples R China
[4] Inspur Elect Informat Ind Co Ltd, Jinan, Shandong, Peoples R China
来源
2017 15TH IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS AND 2017 16TH IEEE INTERNATIONAL CONFERENCE ON UBIQUITOUS COMPUTING AND COMMUNICATIONS (ISPA/IUCC 2017) | 2017年
基金
中国国家自然科学基金;
关键词
power consumption; cloud; data center; workflow scheduling; deadline-constrained; TASK;
D O I
10.1109/ISPA/IUCC.2017.00038
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid expanding of the demand for shifting application workflows in both scientific and business fields to clouds to reduce the execution time and costs, cloud data centers are increasingly established and their volumes are becoming bigger. As a result, soaring power consumption of data centers and the related environmental costs have become inevitable concerns of cloud providers and government. We study the power consumption optimization problem in homogenous cloud data centers and propose a method consisting of two algorithms to schedule deadline-constrained workflows. Time utilization maximization scheduling (TUMS) is a heuristic list scheduling algorithm which is designed to find the minimum number of VM instances needed to finish a workflow in the given time. Then, through slack time reclamation, working time minimization (WTM) algorithm minimizes the working time of the VMs being used in the scheduling scheme. By comparing with some effective scheduling algorithms on randomly generated DAGs, the experimental results show that the TUMS can guarantee the deadline constraint with less VMs, in addition, with these two algorithms, our method can effectively reduce the power consumption.
引用
收藏
页码:206 / 213
页数:8
相关论文
共 29 条
[1]   LOWER BOUND ON THE NUMBER OF PROCESSORS AND TIME FOR SCHEDULING PRECEDENCE GRAPHS WITH COMMUNICATION COSTS [J].
ALMOUHAMED, MA .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1990, 16 (12) :1390-1401
[2]  
[Anonymous], 2011, IEEE ACM INT C GRID, DOI [DOI 10.1109/GRID.2011.13, 10.1109/Grid.2011.13]
[3]  
[Anonymous], IEEE T SUSTAINABLE C
[4]   BTS: Resource capacity estimate for time-targeted science workflows [J].
Byun, Eun-Kyu ;
Kee, Yang-Suk ;
Kim, Jin-Soo ;
Deelman, Ewa ;
Maeng, Seungryoul .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (06) :848-862
[5]   EONS: Minimizing Energy Consumption for Executing Real-Time Workflows in Virtualized Cloud Data Centers [J].
Chen, Huangke ;
Zhu, Xiaomin ;
Qiu, Dishan ;
Guo, Hui ;
Yang, Laurence T. ;
Lu, Peizhong .
PROCEEDINGS OF 45TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS (ICPPW 2016), 2016, :385-392
[6]   Improving energy efficiency of dedicated cooling system and its contribution towards meeting an energy-optimized data center [J].
Cho, Jinkyun ;
Kim, Yundeok .
APPLIED ENERGY, 2016, 165 :967-982
[7]  
Corcoran P.M., 2013, Tech. Rep.
[8]  
Durillo J. J., 2012, 2012 IEEE 4th International Conference on Cloud Computing Technology and Science (CloudCom). Proceedings, P185, DOI 10.1109/CloudCom.2012.6427573
[9]  
Ghasemzadeh M., 2016, QOS BASED RESOURCE M
[10]   PARALLEL SEQUENCING AND ASSEMBLY LINE PROBLEMS [J].
HU, TC .
OPERATIONS RESEARCH, 1961, 9 (06) :841-848