摘要
详细对比了传统Min-Min算法的高效特性和Max-Min算法的负载平衡特性,在原先提出以改善任务调度时间跨度性能为目标的网格任务自适应调度策略A-MM基础上,提出新的具有动态特性的启发式算法(Heuristic task scheduling algorithm based on Min-Min and Max-Min,H-MM),解决了A-MM不能动态执行的缺点.实验表明,H-MM在充分保留A-MM算法优点基础上实现了算法的动态执行特性,得到了更好的任务调度执行效果.
Comparing the special property of the traditional Min-Min scheduling algorithm and the load balance of the traditional Max-Min scheduling algorithm, for improving the makespan property, a tleuristic task scheduling algorithm based on Min-Min and Max-Min, H-MM based on A-MM, has been proposed, H-MM solved the defect of undynamic of A-MM. The experiments show that H-MM exploit the merit of A-MM while solve the problem of undynamic. Moreover, the algorithm overweighs traditional algorithms a lot in rnakespan parameters,
出处
《新疆大学学报（自然科学版）》
CAS
2008年第3期356-359,363,共5页
Journal of Xinjiang University(Natural Science Edition)
基金
新疆大学青年科研启动基金项目
关键词
网格
任务调度
启发式算法
动态
Grid
task scheduling
heuristic algorithm
dynamic
