信任驱动的网格作业调度算法  

Trust-driven job scheduling heuristics for computing grid

作　　者：张伟哲[1] 刘欣然[2] 云晓春[1] 张宏莉[1] 胡铭曾[1] 刘凯鹏[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001 [2]国家计算机网络应急技术处理协调中心

出　　处：《通信学报》2006年第2期73-79,共7页Journal on Communications

基　　金：国家自然科学基金资助项目(90412001);国家重点基础研究发展计划("973"计划)基金资助项目(2005CB321806)~~

摘　　要：针对目前网格资源管理中信任机制与作业调度机制分离的缺陷,基于网格信任模型与信任效益函数,提出了信任驱动的网格作业调度问题。对传统批作业调度算法进行信任扩展,提出了两种信任驱动的网格作业调度启发式。对信任驱动网格作业调度算法进行大规模仿真实验,有力地证明了信任驱动算法优于传统时间驱动算法,在平均信任效益和总信任效益等方面具有较好的综合性能。Currently existing grid scheduling algorithms largely ignore the impact of trust mechanism, which made their applicability in a realistic environment rather doubtful. Based on the grid trust model and trust utilization functions, a trust-driven grid job scheduling problem was proposed. Trust-driven Min-min and Sufferage job scheduling heuristics were presented, which were extended based on traditional job scheduling strategies. The algorithms were evaluated with large scale simulation. Simulation result demonstrates trust-driven heuristics perform better than time-driven heuristic on average trust utility and total trust utility.

关 键 词：网格计算 网格安全 信任模型 信任驱动 作业调度 

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