| 信任驱动的网格调度算法 |
| |
| 引用本文： | 李冉,于炯,侯勇. 信任驱动的网格调度算法[J]. 计算机工程与应用, 2009, 45(23): 118-122. DOI: 10.3778/j.issn.1002-8331.2009.23.033 |
| |
| 作者姓名： | 李冉 于炯 侯勇 |
| |
| 作者单位： | 新疆大学信息科学与工程学院,乌鲁木齐,830046;新疆大学信息科学与工程学院,乌鲁木齐,830046;北京理工大学,计算机院,北京,100081 |
| |
| 基金项目： | 国家自然科学基金，教育部春晖计划项目 |
| |
| 摘 要： | 针对目前网格资源管理中任务与资源匹配问题的不足,基于信任效益函数与匹配概念,提出了信任驱动的网格调度匹配算法。在调度中同时还考虑了任务和资源效益值,对已经提出的两种信任驱动的网格调度算法进行改进。结果证明:该算法较传统基于的信任驱动调度算法而言,信任效益值,资源效益值,负载平衡和失效服务数等方面有较好的综合性能。
|
| 关 键 词： | 网格计算 作业调度 服务质量 信任关系 信任效益函数 服务质量匹配度 |
| 收稿时间： | 2008-05-06 |
| 修稿时间： | 2008-10-6 |
Trust-driven job scheduling algorithm for computing grid |
| |
| LI Ran,YU Jiong,HOU Yong. Trust-driven job scheduling algorithm for computing grid[J]. Computer Engineering and Applications, 2009, 45(23): 118-122. DOI: 10.3778/j.issn.1002-8331.2009.23.033 |
| |
| Authors: | LI Ran YU Jiong HOU Yong |
| |
| Affiliation: | LI Ran1,YU Jiong1,2,HOU Yong11.School of Information Science , Engineering,Xinjiang University,Urumqi 830046,China 2.School of Computer Science , Technology,Beijing Institute of Technology,Beijing 100081,China |
| |
| Abstract: | At present existing grid scheduling algorithms ignore the impact of matching between resources and tasks.Based on trust utilization functions and matching conception between resources and tasks，a trust-driven grid job scheduling problem is presented for computing grid.The utility of QoS between tasks and resources consideration are taken into in the scheduling to improve Trust-Relation and TD_Min-min scheduling algorithms.Simulation results demonstrate 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. |
| |
| Keywords: | grid computing task schedule Quality of Service（QoS） trust relation trust utility function QoS matching degree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
|
