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 条
  • [41] Extension rule algorithms based on IMOM and IBOHM heuristics strategies
    Li, Ying
    Sun, Ji-Gui
    Wu, Xia
    Zhu, Xing-Jun
    Ruan Jian Xue Bao/Journal of Software, 2009, 20 (06): : 1521 - 1527
  • [42] HCOC: a cost optimization algorithm for workflow scheduling in hybrid clouds
    Fernando Bittencourt, Luiz
    Roberto Mauro Madeira, Edmundo
    JOURNAL OF INTERNET SERVICES AND APPLICATIONS, 2011, 2 : 207 - 227
  • [43] On local search based heuristics for optimization problems
    Kaljun, David
    Zerovnik, Janez
    CROATIAN OPERATIONAL RESEARCH REVIEW, 2014, 5 (02) : 317 - 327
  • [44] BDD-based heuristics for binary optimization
    David Bergman
    Andre A. Cire
    Willem-Jan van Hoeve
    Tallys Yunes
    Journal of Heuristics, 2014, 20 : 211 - 234
  • [45] BDD-based heuristics for binary optimization
    Bergman, David
    Cire, Andre A.
    van Hoeve, Willem-Jan
    Yunes, Tallys
    JOURNAL OF HEURISTICS, 2014, 20 (02) : 211 - 234
  • [46] Global-optimization heuristics based on Ψ-transformation
    Dolgui, A
    Sysoev, V
    RAIRO-OPERATIONS RESEARCH, 2003, 37 (02) : 119 - 141
  • [47] Solving User Priority in Cloud Computing Using Enhanced Optimization Algorithm in Workflow Scheduling
    Aggarwal, Ambika
    Kumar, Sunil
    Bhatt, Ashutosh
    Shah, Mohd Asif
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022
  • [48] Meta-Heuristics Based Approach for Workflow Scheduling in Cloud Computing: A Survey
    Poonam
    Dutta, Maitreyee
    Aggarwal, Naveen
    ARTIFICIAL INTELLIGENCE AND EVOLUTIONARY COMPUTATIONS IN ENGINEERING SYSTEMS, ICAIECES 2015, 2016, 394 : 1331 - 1345
  • [49] Workflow optimization in cervical cancer: a decision rule for bladder filling using ultrasound
    Heldens-van Rooij, Mieke
    Kusters, Martijn
    Verhoef, Cornelia G.
    RADIOTHERAPY AND ONCOLOGY, 2024, 194 : S5532 - S5534
  • [50] Budget constrained Priority based Genetic Algorithm for workflow scheduling in cloud
    Verma, Amandeep
    Kaushal, Sakshi
    IET Conference Publications, 2013, 2013 (645 CP): : 216 - 222