位置:成果数据库 > 期刊 > 期刊详情页
基于信任QoS增强的网格服务调度算法
  • ISSN号:0254-4164
  • 期刊名称:《计算机学报》
  • 时间:0
  • 分类:TP393[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001, [2]国家计算机网络应急技术处理协调中心,北京100029
  • 相关基金:本课题得到国家“九七三”重点基础研究发展规划项目基金(G2005CB321806)和国家自然科学基金(90412001)资助.Background This work is supported by the National Natural Science Foundation of China under grant No. 90412001 and the National Basic Research Program(973 Program) of China under grant No. G2005CB321806. The key problem in both of the programs is the network resource management and task scheduling in large-scale computational service grid environment. Traditionally the aim of task scheduling is to optimize the performance QoS of tasks such as makespan. However,grid resources are distributed in different grid-domains and out of control, which requires that trust mechanisms are incorporated into different scheduling policies. Thus, we should not only focus on the performance QoS but also the trust QoS when we design the tasks scheduling systems. This paper provides a trust-QoS enhanced computational service scheduling to harmonize the performance and trust QoS as a pre-research to enhance the computational service scheduling systems.
中文摘要:

针对目前服务网格资源管理中存在的信任机制与调度机制分离的缺陷,基于网格信任模型与信任效益函数,讨论了信任Qos增强的计算服务调度问题.分析传统调度算法的缺陷,提出了基于信任关系的网格服务调度算法.该算法在保证服务性能QoS要求的同时兼顾信任QoS的要求.对基于信任关系的网格服务调度算法性能进行了多角度分析和大规模仿真实验.结果表明:该算法较传统的基于性能QoS的调度启发式和另外两种基于信任QoS的调度启发式而言,不仅具有较优的平均信任效益、总信任效益和较小的最终服务期,而且在失效服务数和系统吞吐率等方面具有较好的综合性能.

英文摘要:

At present existing scheduling algorithms in service grid largely ignore the impact of trust mechanism. It is rather doubtful to adopt these algorithms in a realistic environment. Based on the grid trust model and trust utilization functions, a computational service scheduling problem based on trust QoS enhancement is proposed. A novel trust-QoS enhanced heuristic based on trust relationship is put forward. The algorithms are evaluated with large scale simulation. Simulation results demonstrate trust-driven heuristics perform better than time-driven heuristic. The algorithm based on trust relationship achieves better integrative performance on performance- QoS, trust-QoS, etc. than trust-driven Min-Min and Sufferage heuristic algorithms.

同期刊论文项目
期刊论文 36 会议论文 10
同项目期刊论文
期刊信息
  • 《计算机学报》
  • 北大核心期刊(2011版)
  • 主管单位:中国科学院
  • 主办单位:中国计算机学会 中国科学院计算技术研究所
  • 主编:孙凝晖
  • 地址:北京中关村科学院南路6号
  • 邮编:100190
  • 邮箱:cjc@ict.ac.cn
  • 电话:010-62620695
  • 国际标准刊号:ISSN:0254-4164
  • 国内统一刊号:ISSN:11-1826/TP
  • 邮发代号:2-833
  • 获奖情况:
  • 中国期刊方阵“双效”期刊
  • 国内外数据库收录:
  • 美国数学评论(网络版),荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版),中国北大核心期刊(2000版)
  • 被引量:48433