基于QoS约束的网格任务调度算法  

Grid Task Scheduling Algorithm Based on QoS Dimensions

作　　者：王浩[1] 李飞[1] 

机构地区：[1]成都信息工程学院网络工程学院,成都610225

出　　处：《四川理工学院学报（自然科学版）》2013年第1期47-50,共4页Journal of Sichuan University of Science & Engineering(Natural Science Edition)

基　　金：四川省科技支撑项目(2011GZ0195)

摘　　要：针对网格环境下不同类型的用户任务执行时间差异较大的问题,在对现有网格调度算法研究之后,基于Min-min算法和Sufferage算法提出了基于任务QoS约束与任务损失度的最小最早完成时间算法QDSM。算法克服了Min-min算法仅追求局部最优而忽视了全局的缺点。分析测试结果表明,算法实现了调度跨度与负载均衡、用户QoS约束的统一,在综合性能上有较大提高。Aiming at the problem that the grid environment of different types of user task execution time different, and research on the existing grid heuristic scheduling algorithm, the proposed a new algorithm based on task QoS dimensions and task sufferage, called QoS Dimensions and Sufferage Min-min （QDSM）, which is based on both Min-min algorithm and Suf- ferage algorithm. The new algorithm overcomes the Min-min algorithm only to pursue local optimal of the shortcomings and ignore the global optimal. The statistic from the experiments reveal that QDSM algorithm has merits of the better executing efficiency, less time to complete the task, high load balance degree and user QoS dimensions by comparing with Min-min algorithm and Sufferage algorithm.

关 键 词：任务调度 时间跨度 Min—min算法 QOS约束 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]