期刊文献+

允许违反局部时间约束的科学工作流调度策略 被引量:3

A scheduling policy of scientific workflows allowing the violation of local time constraints
下载PDF
导出
摘要 提高科学工作流在云环境中的执行效率、降低执行费用受到广泛关注。用户期望的局部QoS约束与工作流的总体执行效率之间往往存在矛盾。针对该现象,在前期的研究基础上提出一种允许违反局部时间约束的科学工作流调度策略。通过对已聚簇的工作流任务集使用任务后向优先合并的方法,可实现任务间空闲时间片的合理利用,进而优化科学工作流的执行时间;另外,为充分利用任务的松弛时间,提高工作流的整体执行效率,允许部分任务的调度违反局部最晚完成时间的约束。实验结果表明,该策略能提前科学工作流的最早完成时间,提高处理机的利用率,并最终降低工作流的执行费用。 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.
出处 《计算机工程与科学》 CSCD 北大核心 2016年第11期2165-2171,共7页 Computer Engineering & Science
基金 国家自然科学基金(61462076) 甘肃省自然科学基金(1208RJZA134) 甘肃省科技支撑计划(1104GKCA023) 西北师范大学青年教师科研提升计划(NWNU-LKQN-12-30)
关键词 科学工作流 任务调度 任务聚簇 松弛时间 局部约束 scientific workflow task scheduling cluster aggregation slack time local constraint
  • 相关文献

参考文献5

二级参考文献48

  • 1邸楠,王韬,李晓明.LilyTask任务并行环境中基于任务关系的初始任务分配算法[J].计算机学报,2005,28(5):892-899. 被引量:6
  • 2何琨,赵勇,陈阳.分布式环境下多任务调度问题的分析与求解[J].系统工程理论与实践,2007,27(5):119-125. 被引量:12
  • 3范玉顺.工作流管理技术基础--实现企业业务过程重组.过程管理与业务过程自动化的核心技术[M].北京:清华大学出版社/施普林格出版社,2001.110-169.
  • 4Bozdag D.A task duplication based scheduling algorithm using partial schedules[D].Ohio State University,2005.
  • 5Colin J Y,Chretienne C EScheduling with small computation delays and task duplication[J].Operation Research,1991,39 (4):680-684.
  • 6Darbha S,Agrawal D P.Optimal scheduling algorithm for distilbuted-memory machines[J].IEEE Trans Parallel and Distributed Systems,1998,9(1):87-94.
  • 7Park C l,Choe T Y.An optimal scheduling algorithm based on task duplication[J].IEEE Trans Computers,2002,51(4):444-448.
  • 8Abroad I,Kwok Y K.On exploiting task duplication in parallel program scheduling[J].IEEE Trans Parallel and Distributed Systems,1998,19(9):872-891.
  • 9Kwok Y K,Ahmad l.On multiprocessor task scheduling using efficient state space search approaches[J].Parallel and Distributed Computing,2005,65:1515-1532.
  • 10Guodong L,Daoxu C,Daming W,et al.Task clustering and scheduling to multiprocessors with duplication[C].Proceedings of the International Parallel and Distributed Processing Symposium,2003.

共引文献79

同被引文献17

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部