检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学计算机学院,湖北武汉430074
出 处:《小型微型计算机系统》2010年第6期1117-1122,共6页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(90715029)资助;教育部重点项目(05128)资助
摘 要:在Buyya设计的GRACE网格资源管理框架下提出一种改进的可信模型.针对网格的动态性,提出一种新的运用服务次数和对评价值取对数方式进行可信度计算和更新的方法.此方法可以有效地阻止恶意节点对正常节点和可信节点的攻击,同时还可防止恶意节点间通过小集团合作方式来提高各自节点的可信度.可信度值曲线示意图表明:本模型较现有模型在抑制网格中恶意节点的活动方面具有更好的效果.根据应用环境的不同需求,对网格经济模型调度算法(DBC)进行改进,分别提出了以时间优化、成本优化和时间成本折衷优化为目的的网格信任调度算法(TrustDBC).模拟实验结果表明:本文算法性能明显优于相应的未考虑信任的调度算法.Using economic principle to resource management and scheduling in Grid environment is an efficient method in applying Grid theory to practical application.This study mainly examines the integration of the notion of "trust" into resource management based on GRACE Grid Architecture that proposed by Dr.Buyya.We improve the trust computing and updating method,this approach applies logarithm for evaluation and counts of services to compute the trust.And it prevents malicious peers to attack the normal peers and trust peers efficiently,meanwhile it restrains the malicious peers from increasing their trust respectively by their group collaboration.The sketch maps of trust value illustrate that the new model controls the behavior of malicious peer in Grid more efficiently.According to the demand of different application environment,We improve the Grid economic model DBC scheduling algorithm and propose time optimization,cost optimization and time cost tradeoff optimization as his goal scheduling algorithms(Trust DBC)based on trust.The performance of these algorithms is excelled the algorithm without considering trust via theory analysis and simulation experiment.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.24