【摘要】 将贪婪算法推广,针对计算网格提出了一种基于经济模型的资源调度算法.将网格计算环境下一组相互独立的计算任务(Meta-Task)的资源调度问题看作是具有限定条件的最优化问题,根据网格用户提供的“deadline”和“budget”,每次选择使得执行最短的任务进行调度.通过在Gridsim环境下的分析与比较,该算法在满足用户要求的QoS需求同时,能够以尽可能少的时间完成任务.更多还原

【Abstract】 A new scheduling algorithm based on economic model was proposed,which extends classic optimization algorithm,keeping the time of computation at the minimum.The algorithm takes“deadline”and“budget”which are provided by different gird users,into consideration. The performance of this new scheduling algorithm,achieving lower job completion time and sat- isfying user’s QoS demand,is demonstrated by its implementation on Gridsim.更多还原