论文部分内容阅读
详细对比了传统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算法优点基础上实现了算法的动态执行特性,得到了更好的任务调度执行效果.
In this paper, the efficient characteristics of the traditional Min-Min algorithm and the load-balancing characteristics of the Max-Min algorithm are compared in detail. Based on the proposed A-MM grid task adaptive scheduling strategy that aims to improve the performance of the task scheduling time span, A heuristic task scheduling algorithm based on Min-Min and Max-Min (H-MM) is proposed to solve the problem that A-MM can not be dynamically implemented. Experiments show that H- Based on the advantages of the algorithm, the dynamic execution characteristics of the algorithm are realized and a better performance of task scheduling is obtained.