• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

Computer Engineering & Science

    Next Articles

A scheduling policy of scientific workflows allowing
the violation of local time constraints

CHEN Wanghu,DUAN Ju,YU Maoyi   

  1. (College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China)
  • Received:2015-07-21 Revised:2015-11-27 Online:2016-11-25 Published:2016-11-25

Abstract:

Improving the execution efficiency as well as reducing the execution cost of the scientific workflows in cloud is important. Focused on the conflict between userdesired local QoS constraints and the overall execution efficiency of the workflow,we propose a scheduling policy of scientific workflows allowing the violation of local time constraints. Based on backward merging of task clusters, free time spans between workflow task executions can be exploited, and the whole execution time of the workflow can be optimized. Furthermore,in order to make full use of the slack time during task execution and improve the overall efficiency of the workflow, some workflow tasks are permitted to violate the local constraint of the latest finish time. Experimental results show that the policy can bring forward the earliest finish time of the workflow and improve the utilization ratio of processors, and eventually lower the execution cost of the workflow.
 

Key words: