Workflow cost optimization heuristics based on advanced priority rule

被引:0
|
作者
Liu, Cancan [1 ]
Zhang, Weimin [1 ]
Luo, Zhigang [1 ]
Ren, Kaijun [1 ]
机构
[1] College of Computer, National University of Defense Technology, Changsha 410073, China
关键词
Cost optimization - Coupling strengths - Temporal mobility (TM) - Utility grids - Workflow scheduling;
D O I
暂无
中图分类号
学科分类号
摘要
The time and cost trade-off problem in workflow scheduling with deadline constraint in utility grids is an NP-hard, but attractive problem. In the past studies, the priority rule, best fit based on time-dependent coupling strength (referred as BFTCS), was adopted to solve this question because BFTCS considers both the features of resources and workflow structures and uses them as two important factors in the iterative heuristic for cost optimization. However, BFTCS did not consider another important factor: the temporal feature of the workflow. In this paper, we define temporal mobility (TM) to describe the temporal feature of the workflow, and incorporate TM into the iterative stage as an important factor to improve the workflow execution cost further. This novel priority rule (referred as best fit based on time-dependent coupling strength and temporal mobility, BFTCSTM) gives priority to the tasks with larger TM and smaller TCS (time-dependent coupling strength) during the iterative stage. Therefore, compared with BFTCS, BFTCSTM slows down the increasing rate of the workflow execution time greatly, and provides more opportunities to other tasks to optimize cost, which decreases the total cost further. The experimental results demonstrate the advantages of BFTCSTM based iterative heuristic.
引用
收藏
页码:1593 / 1600
相关论文
共 50 条
  • [1] Path balance based heuristics for cost optimization in workflow scheduling
    Liu, C.-C. (cancanliu@nudt.edu.cn), 1600, Chinese Academy of Sciences (24):
  • [2] Cost optimization heuristics for deadline constrained workflow scheduling on clouds and their comparative evaluation
    Emmanuel, Bugingo
    Qin, Yingsheng
    Wang, Juntao
    Zhang, Defu
    Zheng, Wei
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2018, 30 (20):
  • [3] A Heuristics-Based Cost Model for Scientific Workflow Scheduling in Cloud
    Al-Khanak, Ehab Nabiel
    Lee, Sai Peck
    Khan, Saif Ur Rehman
    Behboodian, Navid
    Khalaf, Osamah Ibrahim
    Verbraeck, Alexander
    van Lint, Hans
    CMC-COMPUTERS MATERIALS & CONTINUA, 2021, 67 (03): : 3265 - 3282
  • [4] Cost-effective Heuristics for Grid Workflow Scheduling Based on Segment Leveling
    Long Hao
    Di Rui-Hua
    Long Hao
    Huang Ming-He
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL I, 2009, : 496 - +
  • [5] Comparison of heuristics for inhibitory rule optimization
    Alsolami, Fawaz
    Chikalov, Igor
    Moshkov, Mikhail
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS 18TH ANNUAL CONFERENCE, KES-2014, 2014, 35 : 378 - 387
  • [6] Priority Rule Based Heuristics for Project Scheduling Problems with Multi-skilled Workforce Constraints
    Chen Di
    Sun Fu-quan
    Liu Shi-xin
    Wang Yi-fan
    2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2013, : 1846 - 1849
  • [7] Time and cost trade-off heuristics for workflow scheduling based on bottom level
    Liu, Cancan
    Zhang, Weimin
    Luo, Zhigang
    Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology, 2013, 35 (03): : 61 - 66
  • [8] Cost performance of simple priority rule combinations
    Barman, Samir
    Lisboa, Joao V.
    JOURNAL OF MANUFACTURING TECHNOLOGY MANAGEMENT, 2010, 21 (05) : 567 - 584
  • [9] Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects
    Klein, R
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 127 (03) : 619 - 638
  • [10] Tabu search heuristics for workflow resource allocation simulation optimization
    Yu, Yang
    Pan, Maolin
    Li, Xuguang
    Jiang, Huan
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2011, 23 (16): : 2020 - 2033