期刊文献+

基于风险估计模型的网格任务动态级调度算法

Dynamic Level Task Scheduling Algorithm Based on Risk Model in Grid Computing
下载PDF
导出
摘要 网格中的各种资源的失效是不可避免的,为尽可能减少由于资源失效导致任务执行失败带来的影响,网格的任务调度算法的目标不仅要最小化任务执行的时间,还要兼顾考虑任务在资源上执行失败的风险。提出了Risk-DLS(Dynamic Level Scheduling)算法是将资源的风险估计模型与DLS算法相结合,通过仿真试验与DLS算法相比较,新算法在选择适当的参数的情况下,不仅能够最小化DAG型应用的完成时间,还能提高任务执行的成功率,有效的减少网格环境的不确定性对任务执行的影响。 In Grid Computing, various resources including machines and network failures are inevitable and can have an adverse effect on applications execution in the system, therefore the objective of task scheduling is not only to minimize applications running time, but also to reduce risks of application execution failures. A new scheduling algorithm named Risk-DLS( dynamic level scheduling) algorithm is proposed,which combines the risk estimation model of resources with DLS algorithm. The simulation shows that, by choosing reasonable parameters, Risk-DLS algorithm is better than DLS algorithm in terms of running time, at the same time it can reduce adverse impact on uncertainty in grid environment.
作者 易侃 王汝传
出处 《南京邮电大学学报(自然科学版)》 EI 2008年第5期24-29,35,共7页 Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金 国家自然科学基金(60573141和60773041) 国家高技术研究发展计划(863计划)(2006AA01Z201、2006AA01Z439、2007AA01Z404和2007AA01Z478) 江苏省高技术研究计划(BG2006001) 现代通信国家重点实验室基金(9140C1105040805) 江苏省自然科学基金(BK2008451)资助项目
关键词 网格 风险模型 有向无环图 动态级调度 grid risk model DAG dynamic level scheduling (DLS)
  • 相关文献

参考文献21

  • 1FOSTER L,KESSELMAN C,TUECKE S. The Anatomy of the Grid [ J ]. Supercomputer Applications,2001,15 ( 3 ) : 200 - 222.
  • 2FOSTER L, KESSELMAN C, NICK M, et al. The Physiology of the Grid[C]//Open Grid Service infrastructure WG, Global Gird Forum. 2002.
  • 3YANG T, GERASOULIS A. DSC: scheduling parallel tasks on an unbounded number of processors [ J ]. IEEE Trans on Parallel and Distributed Systems, 1994,5 (9) :951 - 967.
  • 4杜晓丽,蒋昌俊,徐国荣,丁志军.一种基于模糊聚类的网格DAG任务图调度算法[J].软件学报,2006,17(11):2277-2288. 被引量:48
  • 5LEE E A, SIH G C. A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures [ J ]. IEEE Trans on Parallel and Distributed Systems, 1993,4 (2) :175 - 187.
  • 6SIH G C, LEE E A. Dynamic-level scheduling for heterogeneous processor networks[ C ]//Proceedings of the Second IEEE Symposium on Parallel and Distributed Systems. Dallas, TX. USA, 1990.
  • 7KONG Xiaohong, XU Wenbo. Ant Colony Algorithm for Scheduling Parallel Program Based on DAG Graph Heuristics [ C ]//The Sixth World Congress on Intelhgent Control and Automation (WCICA 2006 ). Califoraia,2006:3653 - 3657.
  • 8ZHONG Yiwen,YANG Jiangang,Ql Hengnian. A hybrid genetic algorithm for tasks scheduling in heterogeneous computing systems [ C ] // Proceedings of 2004 International Conference on Machine Learning and Cybernetics. Dalian,2004,4:2463 - 2468.
  • 9SAKELLARIOU R, ZHAO H. A hybrid heuristic for DAG scheduling on heterogeneous systems [ C ] // Proceedings 18th International Parallel and Distributed Processing Symposium. 2004 : 111 - 119.
  • 10VASSILEVA J,WANG Yao. Bayesian Network-Based Trust Model [ C ]//Proceedings of the IEEE/WIC International Conference on Web Intelligence ( WI' 03 ). 2003.

二级参考文献29

共引文献344

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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