改进的Min-Min网格任务调度算法

在网格环境中，如何对任务进行高效调度是当前研究的热点问题。目前Min—Min调度算法是一个简单、快速、有效的算法。但它很难满足网格任务对服务质量的要求。在独立型的任务调度模型的基础上，提出了一种基于权值的改进Min—Min调度算法。改进后的算法通过量化网格任务的优先级和等待时间，解决了原有算法存在的高质量任务和大任务等待时间过长的问题。仿真实验结果表明，改进后的算法满足了网格任务对优先级和等待时间的服务质量要求．是一种网格环境下有效的任务调度算法。

Improved Min-Min grid task scheduling algorithm

How to schedule tasks efficiently is a hot research topic in grid environments.Min-Min scheduling algorithm is a simple,fast,efficient algorithm,but it is difficult to meet the grid task requirements on the quality of service.In this thesis,on the basis of the independent task scheduling model,an improved algorithm was proposed based on the weights to solve the existing high quality task and big task waiting for a long time by the quantification of grid task priority and waiting time.The simulation results show that the improved algorithm is an efficient task scheduling algorithm to meet the grid task quality of service requirements on the priority and the waiting time in grid environment.