一个扩展的以QoS为指向的网格任务调度算法  

A Extended QoS Guided Algorithm for Grid Task Scheduling

作　　者：吴俊[1] 张大方[1] 张伟鹏[1] 祝勇刚[1] 

机构地区：[1]湖南大学计算机与通信学院,湖南长沙410082

出　　处：《计算机工程与科学》2005年第4期66-67,70,共3页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(60273070)

摘　　要：在对网格计算的研究中,有人考虑了计算资源中服务质量(QoS)因素,在对传统的 Min Min算法加以改进的基础上,提出了QoS Guided Min Min算法。在此基础上,本文提出一种新的扩展型算法,以进一步提高网格资源的利用率。最后,本文对以上三种算法的实验结果进行了比较分析。In grid computing, the quality of service (QoS) that grid resources can provide or users require should be taken into account before scheduling decisions are made. So, the QoS guided Min-Min heuristic algorithm which is based on traditional Min-Min heuristic is proposed for this situation. In this paper, an extended algorithm called Extended QoS guided Min-Min heuristic is proposed to achieve higher performance. Finally, the comparison and analysis of the simulation results are made to indicate the extended algorithm's priority.

关 键 词：计算机网络 服务质量 资源选择算法 网格任务调度算法 网络带宽 QOS 

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