| 基于非贡献网格的自适应任务调度算法研究 |
| |
| 引用本文： | 侯勇,于炯,田国中,龚红翠.基于非贡献网格的自适应任务调度算法研究[J].微电子学与计算机,2007,24(10):190-192. |
| |
| 作者姓名： | 侯勇 于炯 田国中 龚红翠 |
| |
| 作者单位： | 1. 新疆大学,信息科学与工程学院,新疆,乌鲁木齐,830046
2. 新疆大学,信息科学与工程学院,新疆,乌鲁木齐,830046;北京理工大学,计算机学院,北京,100081 |
| |
| 基金项目： | 国家自然科学基金;教育部春晖计划项目;新疆社会科学基金 |
| |
| 摘 要： | 针对传统的Min-Min算法的高效特性和Max-Min算法的负载平衡特性,引入了资源的服务代价属性和任务的请求代价属性,以提高任务调度的时间跨度性能为目标,提出了一种面向非贡献网格(No-dedicated Grid)的自适应任务调度策略(No-dedicated Adaptive Min-Min and Max-Min,NDA-MM)。实验表明,该算法在时间跨度和可扩展性等方面的综合性能较以往算法有较大提高。
|
| 关 键 词： | 非贡献网格 任务调度 算法 |
| 文章编号： | 1000-7180（2007）10-0190-03 |
| 修稿时间： | 2007-06-18 |
A Study of Adaptive Task Scheduling Algorithm Based on the Non-dedicated Constraint Grid |
| |
| HOU Yong,YU Jiong,TIAN Gong-zhong,GONG Hong-cui.A Study of Adaptive Task Scheduling Algorithm Based on the Non-dedicated Constraint Grid[J].Microelectronics & Computer,2007,24(10):190-192. |
| |
| Authors: | HOU Yong YU Jiong TIAN Gong-zhong GONG Hong-cui |
| |
| Affiliation: | 1 School of Information Science and Engineering, Xinjiang University, Urumqi 830046, China; 2 School of Computer Science and Technology, Beijing Institute of Technology,Beijing 100081, China |
| |
| Abstract: | To the special property of the traditional Min-Min scheduling algorithm and the load balance of the traditional Max-Min scheduling algorithm, the cost of service property of resource and the cost of require property of task in the strategy was brought in. For improving the makespan property, a Non-dedicated Adaptive Min-Min and Max-Min algorithm (NDA-MM), a grid task scheduling based on Non-dedicated grid, has been proposed. The experiments show that the algorithm overweighs traditional algorithms a lot in makespan and scalability parameters. |
| |
| Keywords: | non-dedicated grid task scheduling algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
