A heuristic task scheduling algorithm based on server power efficiency model in cloud environments

被引:29
|
作者
Lin, Weiwei [1 ,3 ]
Wang, Weiqi [1 ]
Wu, Wentai [1 ]
Pang, Xiongwen [2 ]
Liu, Bo [2 ]
Zhang, Ying [2 ]
机构
[1] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510006, Guangdong, Peoples R China
[2] South China Normal Univ, Sch Comp, Guangzhou 510631, Guangdong, Peoples R China
[3] Guangdong Key Lab Big Data Anal & Proc, Guangzhou 510006, Guangdong, Peoples R China
来源
SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS | 2018年 / 20卷
基金
中国国家自然科学基金;
关键词
Cloud computing; Data centers; Power model; Power efficiency model; Task scheduling; SIMULATION;
D O I
10.1016/j.suscom.2017.10.007
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
As the ever-growing energy consumption rises as a global concern, energy conservation in cloud data centers has become a topic of interest. Based on extensive research and experimental analysis of the energy consumption characteristics and performance records from SPEC data set, this paper presents a power efficiency model for cloud servers. With the model, we use server power efficiency to guide task scheduling and propose a heuristic task scheduling algorithm (ECOTS) for optimizing energy consumption in cloud environments. ECOTS takes into account multiple key factors such as task resource requirements, server power efficiency model and performance degradation in order to reduce system energy consumption at a minimal cost of performance. ECOTS algorithm has low time and space complexity with a better global searching ability to approach the optimal scheduling plan. We simulated a heterogeneous cluster environment and conducted experiments to evaluate the effectiveness of ECOTS. Simulation results show that ECOTS algorithm is the most energy-efficient without violating all the cloud tasks' resources requirement. Moreover, ECOTS algorithm effectively reduces total energy consumption by more than 20% compared with the Improvement of Min-Min algorithm. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:56 / 65
页数:10
相关论文
共 50 条
  • [1] Elasticity Based Scheduling Heuristic Algorithm for Cloud Environments
    Al Buhussain, Ali
    De Grande, Robson E.
    Boukerche, Azzedine
    2016 IEEE/ACM 20TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED SIMULATION AND REAL TIME APPLICATIONS (DS-RT), 2016, : 1 - 8
  • [2] Task scheduling optimization in cloud computing based on heuristic Algorithm
    Guo, L. (kftjh@yahoo.com.cn), 1600, Academy Publisher (07):
  • [3] A heuristic algorithm for agent-based task scheduling in grid environments
    Ding, SL
    Yuan, JB
    Ju, JB
    DCABES 2004, Proceedings, Vols, 1 and 2, 2004, : 814 - 818
  • [4] A Duplication Task Scheduling Algorithm in Cloud Environments
    Ruan, Min
    Li, Yun
    Zhang, Yinjuan
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2016, 2016, 9937 : 285 - 292
  • [5] The Scheduling Algorithm of Grid Task Based on Cloud Model
    Gao, Shutao
    ADVANCED MEASUREMENT AND TEST, PARTS 1 AND 2, 2010, 439-440 : 1177 - 1183
  • [6] Heuristic initialization of PSO task scheduling algorithm in cloud computing
    Alsaidy, Seema A.
    Abbood, Amenah D.
    Sahib, Mouayad A.
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2022, 34 (06) : 2370 - 2382
  • [7] A hybrid heuristic workflow scheduling algorithm for cloud computing environments
    Mirzayi, Sahar
    Rafe, Vahid
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2015, 27 (06) : 721 - 735
  • [8] Quadratic Particle Swarm Optimisation Algorithm for Task Scheduling Based on Cloud Computing Server
    Wei, Guanghui
    JOURNAL OF INFORMATION & KNOWLEDGE MANAGEMENT, 2023, 22 (01)
  • [9] Attribute Theory Model Based Task Scheduling Algorithm on Cloud
    Xie, Xiaolan
    Liu, Ruikun
    Hui, Xin
    Ni, Jinsheng
    INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING, 2016, 9 (07): : 111 - 120
  • [10] The Scheduling Algorithm of Grid Task Based on PSO and Cloud Model
    Zhong Shaobo
    He Zhongshi
    ADVANCED MEASUREMENT AND TEST, PARTS 1 AND 2, 2010, 439-440 : 1487 - +