基于信任驱动的网格QoS匹配算法  

QoS Matching Offset Algorithm Based on Trust-Driven for Computing Grid

作　　者：李冉[1] 于炯[1] 侯勇[1] 

机构地区：[1]新疆大学信息科学与工程学院,新疆乌鲁木齐830046

出　　处：《微电子学与计算机》2008年第10期125-128,共4页Microelectronics & Computer

基　　金：国家自然科学基金项目(60563002);教育部春晖计划项目(Z2005-1-65009)

摘　　要：利用信任机制的概念,提出了一种信任驱动的网格QoS匹配算法——TD_QMO(Trust Drive QoS Matching Offset).引入任务与资源的QoS匹配概念,能够根据任务需求来分配,同时还考虑了在调度中的任务和资源QoS效益值.模拟结果显示该算法比TD Trust-Relation,TD_Min-min的信任效益、资源效益、负载平衡有明显的提高.Job schedule algorithm TD_ QMO based on trust- driven is presented for computing grid. In the paper, by introducing the conception of QoS matching offset between tasks and resources in Grid scheduling tasks are able to be allocated on demand. Meanwhile, we take into consideration the utility of QoS between tasks and resources in the scheduling. The simulation results show that the algorithm＇s performance is better than TD Trust - Relation, TD _ Min- min in the aspects of trust utility, effective resource utility, load balance.

关 键 词：网格计算 任务调度 信任模型 信任驱动 QoS匹配偏移值 

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