基于信任驱动的网格任务调度新算法  

New grid job scheduling algorithm based on trust-driven

作　　者：黄德才[1] 张丽君[1] 陆亿红[1] 龚卫华[1] 

机构地区：[1]浙江工业大学信息工程学院,杭州310032

出　　处：《计算机应用研究》2007年第11期26-29,共4页Application Research of Computers

基　　金：浙江省自然科学基金资助项目(Y105118;Y105109)

摘　　要：利用信任机制的概念,对传统网格调度算法进行改进,提出了信任驱动的动态调度算法TD_OLB、TD_MCT和静态调度算法TD_max-min;同时,在相同的假定条件设置下对这些新算法进行了仿真分析和比较研究。仿真结果表明,基于信任机制的调度算法不仅优于传统的基于makespan的调度算法,而且当要求强信任关系任务的数量大于弱信任关系及无信任关系的任务数量时,信任驱动的TD_max-min调度算法优于信任驱动的TD_min-min算法。Applying the concept of trust and with the improvement on the traditional scheduling algorithm, dynamic algorithms TD_OLB, TD_MCT and static algorithm TD_max-min were presented based on trust-driven. At the meanwhile, the algorithms were compared with the traditional ones in the same condition and samples by simulation. The results illustrate that the schedu- ling algorithms based on trust-driven are better than the traditional ones based on makespan. Moreover, when the number Of the jobs with strong trusting relation is more than the total with weak trusting and without trusting relation, the performance of improved TD_max-min algorithm is better than the TD_min-min algorithm.

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

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]