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 条
[21]   A taxonomy and survey on scheduling algorithms for scientific workflows in IaaS cloud computing environments [J].
Rodriguez, Maria Alejandra ;
Buyya, Rajkumar .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2017, 29 (08)
[22]   Optimizing energy consumption for data centers [J].
Rong, Huigui ;
Zhang, Haomin ;
Xiao, Sheng ;
Li, Canbing ;
Hu, Chunhua .
RENEWABLE & SUSTAINABLE ENERGY REVIEWS, 2016, 58 :674-691
[23]   Power Comparison of Cloud Data Center Architectures [J].
Ruiu, Pietro ;
Bianco, Andrea ;
Fiandrino, Claudio ;
Giaccone, Paolo ;
Kliazovich, Dzmitry .
2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
[24]   Cost-efficient task scheduling for executing large programs in the cloud [J].
Su, Sen ;
Li, Jian ;
Huang, Qingjia ;
Huang, Xiao ;
Shuang, Kai ;
Wang, Jie .
PARALLEL COMPUTING, 2013, 39 (4-5) :177-188
[25]  
The Green Grid, 2007, GREEN GRID DAT CTR P
[26]   Performance-effective and low-complexity task scheduling for heterogeneous computing [J].
Topcuoglu, H ;
Hariri, S ;
Wu, MY .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2002, 13 (03) :260-274
[27]   Resource and Instance Hour Minimization for Deadline Constrained DAG Applications Using Computer Clouds [J].
Wu, Hao ;
Hua, Xiayu ;
Li, Zheng ;
Ren, Shangping .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (03) :885-899
[28]  
Yu J., 2005, QOS BASED SCHEDULING, P5
[29]   EAD and PEBD: Two Energy-Aware Duplication Scheduling Algorithms for Parallel Tasks on Homogeneous Clusters [J].
Zong, Ziliang ;
Manzanares, Adam ;
Ruan, Xiaojun ;
Qin, Xiao .
IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (03) :360-374