大连理工大学学报2012，Vol.52Issue(2)：277-284,8.
基于动态任务优先级的网格任务调度算法研究
Research on task scheduling algorithm in grid computing systems based on dynamic task priority
摘要
Abstract
Task scheduling is a NP-complete problem in the grid environment.To ensure that the task most significantly affects the makespan can be scheduled in each scheduling step,the task scheduling algorithm by using dynamic task priority is proposed.The critical path of directed acyclic graph（DAG） is dynamically determined and the idle time slots of nodes are effectively utilized to replicate task for reducing the communication overhead and shortening the overall execution time.Extensive experiments are carried out and the research results show that the proposed algorithm outperforms the HEFT algorithm and the DDS algorithm in execution time.关键词
网格环境/任务调度/动态任务优先级/任务复制/调度长度Key words
grid environment task scheduling dynamic task priority task duplication scheduling length分类
信息技术与安全科学引用本文复制引用
孟宪福,闫玲玲,刘伟伟..基于动态任务优先级的网格任务调度算法研究[J].大连理工大学学报,2012,52(2):277-284,8.基金项目
国家自然科学基金资助项目（60973014）. （）
