Minimum Dependencies Energy-Efficient Scheduling in Data Centers

被引:23
|
作者
Zotkiewicz, Mateusz [1 ,2 ]
Guzek, Mateusz [3 ]
Kliazovich, Dzmitry [4 ]
Bouvry, Pascal [5 ]
机构
[1] Warsaw Univ Technol, Inst Telecommun, Nowowiejska 15-19, PL-00665 Warsaw, Poland
[2] Univ Luxembourg, Luxembourg, Luxembourg
[3] Univ Luxembourg, Interdisciplinary Ctr Secur Reliabil & Trust, Luxembourg, Luxembourg
[4] Univ Luxembourg, Fac Sci Technol & Commun, Luxembourg, Luxembourg
[5] Univ Luxembourg, Fac Sci Technol & Commun, Comp Sci & Commun Res Unit, Luxembourg, Luxembourg
关键词
Workflow scheduling; DAG scheduling; energy-efficient; dynamic scheduling; PERFORMANCE; ALGORITHMS; TASKS;
D O I
10.1109/TPDS.2016.2542817
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This work presents an on-line, energy-and communication-aware scheduling strategy for SaaS applications in data centers. The applications are composed of various services and represented as workflows. Each workflow consists of tasks related to each other by precedence constraints and represented by Directed Acyclic Graphs (DAGs). The proposed scheduling strategy combines advantages of state-of-the-art workflow scheduling strategies with energy-aware independent task scheduling approaches. The process of scheduling consists of two phases. In the first phase, virtual deadlines of individual tasks are set in the central scheduler. These deadlines are determined using a novel strategy that favors tasks which are less dependent on other tasks. During the second phase, tasks are dynamically assigned to computing servers based on the current load of network links and servers in a data center. The proposed approach, called Minimum Dependencies Energy-efficient DAG (MinD+ED) scheduling, has been implemented in the GreenCloud simulator. It outperforms other approaches in terms of energy efficiency, while keeping a satisfiable level of tardiness.
引用
收藏
页码:3561 / 3574
页数:14
相关论文
共 50 条
  • [1] Energy-efficient Task Scheduling in Data Centers
    Mhedheb, Yousri
    Streit, Achim
    [J]. PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND SERVICES SCIENCE, VOL 1 (CLOSER), 2016, : 273 - 282
  • [2] Temporal Request Scheduling for Energy-Efficient Cloud Data Centers
    Bi, Jing
    Yuan, Haitao
    Qiao, Junfei
    Zhou, MengChu
    Song, Xiao
    [J]. PROCEEDINGS OF THE 2017 IEEE 14TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC 2017), 2017, : 180 - 185
  • [3] Energy-efficient DAG scheduling with DVFS for cloud data centers
    Yang, Wenbing
    Zhao, Mingqiang
    Li, Jingbo
    Zhang, Xingjun
    [J]. JOURNAL OF SUPERCOMPUTING, 2024, 80 (10): : 14799 - 14823
  • [4] Energy-Efficient Stable and Balanced Task Scheduling in Data Centers
    Safavi, Mohammadhassan
    Landfeldt, Bjorn
    [J]. IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING, 2021, 6 (02): : 306 - 319
  • [5] Energy-Efficient Data Centers
    Shi, Weisong
    Wenisch, Thomas F.
    [J]. IEEE INTERNET COMPUTING, 2017, 21 (04) : 6 - 7
  • [6] Energy-efficient data centers
    Shuja, Junaid
    Madani, Sajjad A.
    Bilal, Kashif
    Hayat, Khizar
    Khan, Samee U.
    Sarwar, Shahzad
    [J]. COMPUTING, 2012, 94 (12) : 973 - 994
  • [7] Energy-Efficient Data Centers
    Stein, Jeff
    Bean, John
    Dunlap, Kevin
    [J]. ASHRAE JOURNAL, 2009, 51 (01) : 12 - +
  • [8] Energy-efficient data centers
    Junaid Shuja
    Sajjad A. Madani
    Kashif Bilal
    Khizar Hayat
    Samee U. Khan
    Shahzad Sarwar
    [J]. Computing, 2012, 94 : 973 - 994
  • [9] Resource Scheduling for Energy-Efficient in Cloud-Computing Data Centers
    Xu, Song
    Liu, Lei
    Cui, Lizhen
    Chang, Xiujuan
    Li, Hui
    [J]. IEEE 20TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS / IEEE 16TH INTERNATIONAL CONFERENCE ON SMART CITY / IEEE 4TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND SYSTEMS (HPCC/SMARTCITY/DSS), 2018, : 774 - 780
  • [10] Energy-Efficient Virtualized Scheduling and Load Balancing Algorithm in Cloud Data Centers
    Jeevitha, J. K.
    Athisha, G.
    [J]. INTERNATIONAL JOURNAL OF INFORMATION RETRIEVAL RESEARCH, 2021, 11 (03) : 34 - 48