| TD_Max-min:信任驱动的网格任务调度新算法 |
| |
| 引用本文： | 黄德才,张丽君,郑月锋,刘端阳. TD_Max-min:信任驱动的网格任务调度新算法[J]. 计算机工程, 2007, 33(24): 80-82 |
| |
| 作者姓名： | 黄德才 张丽君 郑月锋 刘端阳 |
| |
| 作者单位： | 浙江工业大学信息学院,杭州,310014;浙江工业大学信息学院,杭州,310014;浙江工业大学信息学院,杭州,310014;浙江工业大学信息学院,杭州,310014 |
| |
| 摘 要： | 利用信任机制的概念，对传统的Max-min调度算法进行改进，提出一种信任驱动的网格任务调度算法——TD_Max-min。在相同的假定条件设置下，将其与现有的TD_Min-min算法和TD_Sufferage算法进行仿真和比较研究。结果表明，信任驱动的网格调度算法不仅优于传统的基于时间的调度算法，而且当具有强信任关系的任务数量大于弱信任关系及无信任关系的任务数量时，TD_Max-min算法的调度性能明显优于TD_Min-min算法。
|
| 关 键 词： | 网格计算 任务调度 网格安全 信任模型 信任驱动 |
| 文章编号： | 1000-3428(2007)24-0080-03 |
| 修稿时间： | 2006-12-21 |
TD_Max-min: New Trust-driven Job Schedule Algorithm for Grid Computing |
| |
| HUANG De-cai,ZHANG Li-jun,ZHENG Yue-feng,LIU Duan-yang. TD_Max-min: New Trust-driven Job Schedule Algorithm for Grid Computing[J]. Computer Engineering, 2007, 33(24): 80-82 |
| |
| Authors: | HUANG De-cai ZHANG Li-jun ZHENG Yue-feng LIU Duan-yang |
| |
| Affiliation: | College of Information Engineering, Zhejiang University of Technology, Hangzhou 310014 |
| |
| Abstract: | New job schedule algorithm TD_Max-min based on trust-driven is presented for computing grid. Using the same samples and under the same conditions, TD_Max-min algorithm with current schedule algorithms TD_Min-min & TD_Sufferage are compared with numerical experiments. Experimental results show that trust-driven schedule algorithms are better than traditional time-driven ones, especially when the number of tasks with strong trusting relation requirement is more than that with weak trusting or without trusting relation requirement. |
| |
| Keywords: | grid computing job schedule grid security trust model trust-driven |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
