Endpoint Communication Contention-Aware Cloud Workflow Scheduling

被引:26
|
作者
Wu, Quanwang [1 ]
Zhou, MengChu [2 ,3 ]
Wen, Junhao [4 ]
机构
[1] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China
[2] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
[3] King Abdulaziz Univ, Ctr Res Excellence Renewable Energy & Power Syst, Jeddah 21589, Saudi Arabia
[4] Chongqing Univ, Coll Software Engn, Chongqing 400044, Peoples R China
基金
中国国家自然科学基金;
关键词
Processor scheduling; Task analysis; Cloud computing; Job shop scheduling; Servers; Bandwidth; Computational modeling; directed acyclic graph; endpoint communication contention; list scheduling; workflow scheduling; SCIENTIFIC WORKFLOWS; COST; ALGORITHM; TASKS; SECURITY;
D O I
10.1109/TASE.2020.3046673
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud platforms have recently become a popular target execution environment for numerous workflow applications. Hence, effective workflow scheduling strategies in cloud environments are in high demand. However, existing scheduling algorithms are grounded on an idealized target platform model where virtual machines are fully connected, and all communications can be performed concurrently. A significant aspect neglected by them is endpoint communication contention when executing workflows, which has a large impact on workflow makespan. This article investigates how to incorporate contention awareness into cloud workflow scheduling and proposes a new practical scheduling model. Endpoint communication contention-aware List Scheduling Heuristic (ELSH) is designed to minimize workflow makespan. It uses a novel task ranking property and schedules data communications to communication resources besides scheduling tasks to computing resources. Moreover, a rescheduling technique is employed to improve the schedule. In experiments, ELSH is evaluated against the traditional contention-oblivious list scheduling algorithm, which is adapted to address contention during execution in practice. The experimental results reveal that ELSH performs more efficaciously compared with the adapted traditional ones.
引用
收藏
页码:1137 / 1150
页数:14
相关论文
共 50 条
  • [1] Autonomic resource contention-aware scheduling
    Sheikhalishahi, Mehdi
    Grandinetti, Lucio
    Wallace, Richard M.
    Luis Vazquez-Poletti, Jose
    SOFTWARE-PRACTICE & EXPERIENCE, 2015, 45 (02): : 161 - 175
  • [2] Contention-aware scheduling with task duplication
    Sinnen, Oliver
    To, Andrea
    Kaur, Manpreet
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (01) : 77 - 86
  • [3] Contention-Aware Scheduling with Task Duplication
    Sinnen, Oliver
    To, Andrea
    Kaur, Manpreet
    JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING, 2009, 5798 : 157 - 168
  • [4] Contention-Aware Scheduling on Multicore Systems
    Blagodurov, Sergey
    Zhuravlev, Sergey
    Fedorova, Alexandra
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2010, 28 (04):
  • [5] A Communication Contention-Aware Greedy Algorithm for Scheduling Join Task Graphs
    Zhang, Jianjun
    Huang, Dengbin
    Qu, Yong
    2012 WORLD AUTOMATION CONGRESS (WAC), 2012,
  • [6] Contention-Aware Scheduling for Asymmetric Multicore Processors
    Fan, Xiaokang
    Sui, Yulei
    Xue, Jingling
    2015 IEEE 21ST INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2015, : 742 - 751
  • [7] Contention-Aware Lock Scheduling for Transactional Databases
    Tian, Boyu
    Huang, Jiamin
    Mozafari, Barzan
    Schoenebeck, Grant
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2018, 11 (05): : 648 - 662
  • [8] Contention-Aware Communication Schedule for High-Speed Communication
    Anthony T.C. Tam
    Cho-Li Wang
    Cluster Computing, 2003, 6 (4) : 339 - 353
  • [9] Contention-Aware Resource Scheduling for Burst Buffer Systems
    Liang, Weihao
    Chen, Yong
    Liu, Jialin
    An, Hong
    47TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP '18), 2018,
  • [10] Cache-Hierarchy Contention-Aware Scheduling in CMPs
    Feliu, Josue
    Petit, Salvador
    Sahuquillo, Julio
    Duato, Jose
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (03) : 581 - 590